Zone pricing consists in determining simultaneously several delivered prices together with the zones where they are applied. A model and algorithm are prop...

D.-c. programming is a recent technique of global optimization, which allows the solution of problems whose objective function and constraints can be expres...

In this paper, we present a scenario aggregation algorithm for the solution of the dynamic minimax problem in stochastic programming. We consider the case w...

In this paper, we present algorithms for the solution of the dynamic minimax problem in stochastic programs. This dynamic minimax approach is suggested for ...

This survey paper describes the significant advances made in time constrained vehicle routing and crew scheduling problems. In terms of solution methodolog...

Consider a set of logical sentences together with probabilities that they are true. These probabilities must satisfy certain conditions for this system to b...

In this paper we explore a new branching strategy for branch-and-bound approaches based on column generation for the vehicle routing problems with time wind...

Much work has been devoted to the problem of finding maximum likelihood estimators for the three-parameter Weibull distribution. This problem has not been c...

Dendrograms are widely used to represent graphically the clusters and partitions obtained with hierarchical clustering schemes. Espaliers are generalized de...

In a previous paper, a global optimization algorithm, called MLEW, is provided for finding Maximum Likelihood Estimators for the three-parameter Weibull dis...

In this paper, we present three algorithms for the solution of a large-scale zero-sum two-player stochastic game in discrete time, with a finite state set a...

We consider a permutation flow-shop with <i>n</i> jobs and <i>m</i> machines, where the jobs processing times are given by a monotone nondecreasing function...

The NP-hard problem addressed in this paper is well known in the scheduling literature as <i>R</i>|<i>C</i>_{<font size=-1>max</font>}. We introduce...

Ce document explique comment réaliser une implantation efficace d'une méthode d'énumération implicite avec une stratégie du type le meilleur d'abord. Dans l...

The problem of finding a minimal length trajectory (MLT) for a mobile robot has changed in the last five years, as vehicle kinematics have come to be taken ...

We present a method for designing spine layouts. A spine layout is a layout in which a main aisle is used for the movements between the work cells located o...

The bilevel programming problem involves two optimization problems where the data of the first one is implicitly determined by the solution of the second. I...

A proof is given that any normal benzenoid system with <i>h &gt</i> 1 hexagons has two hexagons the removal of each of which results in a normal benzenoid s...

It is shown that the Clar number of a benzenoid hydrocarbon <i>H</i> (defined as the number of circles in a Clar formula, or equivalently as the maximum num...

One type of testing for short circuits in printed circuit boards components is described and modelled as the covering of the edges of a graph by cuts. To mi...

In this paper, optimal strip strategies are developed for a variety of two-dimensional and three-dimensional sequencing problems arising in flexible manufac...

We consider graphs <i>G = </i>(<i>V, E</i>) with order <i>p</i> = |<i>V</i>|, size <i>e</i> = |<i>E</i>| and stability number <i><img src="beta.gif" align=m...

Nous développons une méthode de comparaison de deux profils à l'aide d'un coefficient de concentration des points d'un nuage de l'un des profils par rapport...

We present a new two-commodity flow formulation for the traveling salesman problem. Each commodity corresponds to a resource that is either distributed or p...

We show that certain reasonable axioms for an optimal solution to the problem of locating a facility on a network, i.e., axioms of distance determination, P...

In this paper a class of large, structured linear programs arising in multi-regional (or multi-sectoral) commodity exchange problems, is examined. A decompo...

The rectangular cutting-stock problem consists in laying out a specified list of rectangular pieces on a minimum number of rectangular sheets. A pattern is ...

Five recent practically efficient methods for solving the maximum clique problem are briefly described and compared on randomly generated graphs. A Fortran ...

In the vehicle routing cost allocation problem the aim is to find a good cost allocation method, i.e. a method that according to specified criteria allocate...

This note deals with spatial (multi-market) and multi-commodity versions of the classical Cournot (1838) oligopoly. Our objective is to find non-cooperative...

In this paper, the expected distance between two uniformly distributed random points in a rectangle or in a rectangular parallelepiped is computed under thr...

Many properties of benzenoid hydrocarbons can be explained in terms of their maximum number of mutually resonant hexagons. It is shown that this number can ...

This paper proposes a model for the optimal choice among three alternative new markets for Québec electricity: new electrical processes in the industrial se...

The large-scale MARKAL Linear Program is applied (separately) to the energy systems of Québec and of Ontario, under several alternative constraints on emiss...

We consider a differential game model to investigate the effects of price subsidy over time on the rate of diffusion of a new technology. We assume that the...

It is an old observation that for the Generalized Assignment Problem (GAP) a Linear Programming (LP) relaxation introduces only few fractions in the solutio...

A recent global optimization algorithm using decomposition (GOP), due to Floudas and Visweswaran, when specialized to the case of polynomial functions is sh...

Examination scheduling is a problem in virtually every high school, college and university. The basic challenge is to schedule examinations over a limited ...

We consider the problem of minimizing the weighted sum of earliness and tardiness of jobs scheduled around a common due date, <i>d</i>. The weight of a job ...

The off-line vertex enumeration problem for polytopes consists in determining all vertices of a given polytope <i>P</i>. The on-line vertex enumeration prob...

Consider a benzenoid system with fixed bonds and the subgraph obtained by deleting fixed double bonds together with their end vertices and fixed single bond...

It is shown that any vertex which is simplicial in the complementary graph of a given graph belongs to at least one maximum clique of that graph. This prope...

A hexagonal system is a connected plane graph without cut vertices in which each interior face is a regular hexagon. A linear algorithm is proposed to find ...

Weber's problem consists in locating a facility in the plane in such a way that the weighted sum of Euclidean distances to <i>n</i> given points be minimum....

A method to compute various upper bounds for the Clar number (defined as the number of circles in a Clar formula) of a benzenoid hydrocarbon is given. Based...

If the processing time of each job in a flow-shop also depends on waiting time (or on the time spent prior to processing), then the choice of a sequence inf...

Cette thèse a pour thème central l'optimisation de diverses opérations accomplies par une cellule flexible traitant le métal en feuilles. Les deux problèmes...

In many manufacturing systems, parts must be fed to automatic machines in a specific orientation. This is often accomplished by what are known as part orien...

There has been much recent statistical research in the area of inference under constraints. Here we consider the problem of bounded parameter estimation, in...

This paper presents the first experiments undertaken with a stochastic programming model of gas contract portfolio management. This model is intended to be ...

A necessary and sufficient condition is given for the Clar graph and the inner dual of a benzenoid system to be equal. It is shown that <i>k &gt</i> 2 hexag...

In a first attempt to explain the good behavior of local improvement heuristics (such as Tabu Search and Simulated Annealing) for the <i>k</i>-coloring prob...

We investigate here the problems raised by the demand for quality. In particular, we show that the (inverse) demand, which yields the price the consumers ar...