We consider the multiple depot vehicle scheduling problem (MDVSP) and propose a branch-and-bound algorithm for solving it that combines column generation, va...

Let <i>G</i> be a simple graph on <i>n</i> vertices with the eigenvalues (of an adjacency matrix) &lambda;₁ &ge; &lambda;₂ &ge; ... &g...

This paper formulates and analyzes a pattern search method for general constrained optimization based on filter methods for step acceptance. Roughly, a f...

We explore how a simple linear change of variable affects the inclusion functions obtained with Interval Analysis methods. Univariate and multivariate pol...

Lattice rules are among the best methods to estimate integrals in a large number of dimensions. They are part of the <i>quasi-Monte Carlo</i> set of tools. ...

In the undirected <i>Hierarchical Chinese Postman Problem</i> (HCPP), the edges of a graph are partitioned into clusters and must be serviced while respecti...

Recently, Araujo and De la Pena (1998) gave bounds for the connectivity index of chemical trees as a function of this index for general trees and the ramifi...

This article deals with the problem of GPRS simulation and performance. The GPRS is an evolution of the GSM that allows packet data transfer. An important i...

This paper contains a new convergence analysis for the Lewis and Torczon GPS class of pattern search methods for linearly constrained optimization. The ana...

We survey computers systems which help to obtain and sometimes provide automatically conjectures and refutations in algebraic graph theory.

A variant of method of centers for convex optimization is considered. Given an upper bound on the objective function, the algorithm searches for an "approx...

Let <i>G</i> be a graph and <i>d_v</i> the degree (= number of first neighbors) of its vertex <i>v</i>. The connectivity index of <i>G</i> is <img...

Global climate change issue raises two basic questions: What to do to guarantee the long-term efficiency (or the least collective cost) of international gre...

Rotating work schedules are encountered in several industries and public sector organizations where work is carried out 24 hours a day, seven days a week. ...

This paper addresses the suboptimal regulator design problem of discrete-time jump linear system by using time-multiplied performance index. For a given st...

This chapter deals with the regulator design problem for the class of jump linear systems. Optimal regulator design, suboptimal regulator with time-multipli...

We consider a set of countries that wish to sign an international agreement to control pollution. The problem is studied from the perspective of cooperativ...

We study various uniform <i>k</i>-partition problems which consist in partitioning <i>m</i> sets, each of cardinality <i>k</i>, into <i>k</i> sets of cardin...

We consider the problem of minimizing makespan in a no-wait flow-shop with three machines. Lot streaming (lot sizing) is the process of creating sublots t...

This paper considers stochastic stability and stochastic stabilizability of linear discrete-time systems with Markovian jumps and mode-dependent time-delays...

Eugène is a sophisticated mixed integer linear programming model developed to help regional decision makers on long-term planning for solid waste management...

This paper introduces a new kind of operational crew scheduling problem which consists in simultaneously modifying, as necessary, the existing flight depart...

This article traces the evolution of ambulance location and relocation models proposed over the past thirty years. The models are classified in two main ca...

This paper presents an analysis of the forward link capacity of a cellular network, based on IS-95 CDMA technology. The forward link, or downlink, refers to...

Variable neighborhood search (VNS) is a recent metaheuristic for solving combinatorial and global optimization problems whose basic idea is systematic chang...

We give characterizations of integral graphs in the family of complete split graphs and a few related families of graphs.

In this paper, the problem of optimally controlling production in a single part unreliable, manufacturing flow line, subjected to a constant rate of demand ...

A generalization of the Roy-Gallai theorem on the chromatic number of a graph is derived which is also an extension of several other results of Berge and of...

In this paper, a fast and complete method to constructively enumerate fusenes and benzenoids is given. It is fast enough to construct several million non is...

In this paper we illustrate a new methodology for the design of fault-tolerant logical topologies in wavelength-routed optical networks exploiting wavelengt...

Although airlines plan aircraft routes and crew schedules in advance, perturbations occur everyday. As a result, flight schedules may become infeasible and ...

This paper presents a multi-commodity network design approach to solve the problem of simultaneously locating I/O stations and determining the orientation o...

This paper deals with dispatching systems in open-pit mines. It illustrates the different strategies that exist for solving the dispatching problem and ana...

La problématique du changement climatique implique des efforts globaux à long terme et la participation des pays en développement est requise pour assurer l...

The problem of estimating a binomial proportion constrained to lie in an interval of the form [<i>a,b</i>] "not equal to" [0,1] is considered. The minimax ...

During the last decade, reverse logistics has been introduced into the manufacturing language. Companies' and public's awareness of environmental issues are...

Graffiti's conjecture 105 states that for any tree the range of transmissions of distance is greater than or equal to the range of degrees. After using the ...

Le commerce électronique est une évolution naturelle du commerce traditionnel. Cette évolution a pour finalité le e-Entreprise. L'impact de ce nouveau conce...

This paper exposes in voluntarily simple terms the concept of <i>S</i>-adapted equilibrium introduced to represent and compute economic equilibria on stocha...

Electronic commerce is a natural evolution of traditional business. This evolution aims at e-Enterprise. The impact of this new concept on the functions of ...

Electronic commerce is a natural evolution of traditional business. This evolution aims at e-Enterprise. The impact of this new concept on the functions of ...

The spatially inhomogeneous smoothness of nonparametric methods is often modelled by Besov and Triebel-type smoothness constraints. For such problems, Donoh...

A data set on categories of congenital heart malformations for sibling pairs (with different malformations) of Fraser and Hunter (1975) is analyzed exactly ...

Thrackleation of graphs and global optimization for quadratically constrained quadratic programming are used to find the octagon with unit diameter and larg...

This paper presents a decomposition approach for the solution of the dynamic programming formulation of the Unit Loading Problem in hydroplant management. T...

This paper considers a case of strongly monotone variational inequality problems defined over a convex set which is given by a "separation oracle". An analy...

In the literature, thermal insulation systems with a fixed number of heat intercepts have been optimized with respect to intercept locations and temperature...

This paper presents the problem of optimally dimensioning a new geographically distributed computer system that handles all communications between aircraft ...

Reduction of some classes of global optimization programs to bilinear programs may be done in various ways, and the choice of method clearly influences the ...

This paper solves the problem of designing an access tree network for which the users are connected to the switches through SONET channels on fiber optics l...

Proposed just a few years ago, Variable Neighborhood Search (VNS) is a new metaheuristic for combinatorial and global optimization, based upon systematic ch...

In this article we propose a model for the topological design problem of multitechnology networks that includes the location of switches and their port conf...

Inspired by previous results on asymptotic minimax estimation for a ball of increasing radius in R^<i>n</i>, we study the analogous problem for do...

The Esau-Williams algorithm is one of the best known heuristics for the Capacitated Minimum Spanning Tree Problem. This research note describes a simple en...

We analyze the extent to which intergenerational teams provide information on workers' productivity in the long run. We use a dynamic stochastic framework ...

This paper addresses the problem whether a cooperative agreement, made at the start of a game, can be sustained over time. The players can reopen negotiatio...

In this paper we illustrate a new methodology for the design of fault-tolerant logical topologies in wavelength-routed optical networks exploiting wavelengt...

This paper describes and solves the operational pilot scheduling problem for one day of operations. The problem consists in simultaneously modifying, as nec...

The <i>p</i>-Center problem consists in locating <i>p</i> facilities and assigning clients to them in order to minimize the maximum distance between a clien...

This article reports on some recent algorithmic development for the <i>Rural Postman Problem</i> (CPP) and for the <i>Capacitated Arc Routing Problem</i> (C...

This paper deals with sensitivity analysis (gradient estimation) of random horizon performance measures of Markov chains. More precisely, we consider genera...

This paper presents a novel integration of interior point cutting plane methods within branch-and-price algorithms. Unlike the classical method, columns are...

A fuzzy clustering problem consists in assigning a set of patterns to a given number of clusters with respect to some criteria such that each of them may be...

On the basis of a variable-neighbourhood search with the AutoGraphiX software, it is conjectured that for even numbers of atoms the fully conjugated acycli...

La Recherche à Voisinage Variable (RVV) est une métaheuristique récente basée sur l'idée d'un chargement systématique de voisinage, à la fois dans une phase...

An algorithm with a complexity linear in the number of vertices is proposed for the computation of the Hyper-Wiener index of chemical trees. This complexity...

The goal in many data analyses is to produce brief summaries which convey the key conclusions. This will be particularly important in survival analysis in m...

Le problème traité dans ce rapport est celui de la conception de réseaux d'accès utilisant la technologie SONET et ayant une topologie en arbre. Nous dévelo...

Maximum Clique is one of the most studied NP-hard optimization problem on graphs because of its simplicity and its numerous applications. A basic Variable N...

This paper presents a dynamic programming approach for the solution of the Unit Loading Problem in hydroplant management. The model accounts for losses in t...

A generalization of the Roy-Gallai theorem is presented: it is based on the existence in any oriented graph of a stable set S such that for any node <i>w</i...

<i>Location-Arc Routing Problems</i> (LARPs) are encountered in contexts where it is necessary to simultaneously determine a traversal of a subset of edges ...

Currently, technological possibilities for implementing multi-service networks include both single technology ATM or IP networks and multi-technology netwo...

The distance matrix of a chemical graph can be computed in quadratic time, and from it can be obtained the distance level patterns (DLP), Wiener, Szeged and...

Preapheresis quantification of circulating CD34+ cells (CD34) may be used to predict peripheral blood progenitor cell (PBPC) yield in subsequent leukapheres...

We consider the problem of locating a line or a line segment in three-dimensional space, such that the sum of distances from the facility represented by the...

This paper considers the problem of locating a facility not among demand points, as is usually the case, but among demand regions which could be market area...