We present a method to compute valid concavity cuts for the linear maxmin programming problem. We consider a primal and a dual approach. In both cases the p...

In this paper we propose a scenario-oriented optimization model and solution algorithm to assess the capacity and the routing of computer networks. The adva...

A count of Kekulé structures for all 1812 distinct fullerene isomers of C₆₀ shows that 20 isomers surpass the count of 12500 for icosahedral C<su...

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

In this paper we consider the Discrete Lotsizing and Scheduling Problem with sequence dependent setup costs and setup times (DLSPSD). DLSPSD contains eleme...

Le présent article constitue un résumé du mémoire de maîtrise de M. Lavigne, présentement candidat au Ph.D. à l'École Polytechnique de Montréal. L'étude rep...

This paper presents methods to determine the optimal transfer batch sizes of various part types between two machines so as to minimize the sum of the total ...

This paper presents a new approach for planning the dispatching, conflict-free routing, and scheduling of automated guided vehicles in a flexible manufactur...

A new paradigm for cluster analysis is outlined. It is called Sequential Clustering. Given a set <i>O</i> of <i>N</i> entities a best cluster of <i>K</i> ...

Crew-Opt is a set-covering method that uses column-generation to produce nearly optimal solutions to crew scheduling problems. We presented this method at t...

It is shown that the degree of freedom of a Kekulé structure <i>K</i> of a cata-condensed benzenoid hydrocarbon <i>H</i> is equal to the number of maximum d...

We consider the problem of finding a shortest path for a car-like robot (approximated by a point) maneuvering around obstacles. This robot is capable of for...

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

Le problème de la satisfaisabilité probabiliste (PSAT) consiste à déterminer, étant donné les probabilités de <i>m</i> événements (ou propositions logiques...

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

The boundary-edges code for a benzenoid <i>H</i> is defined as the lexicographically maximum code obtained travelling around the boundary of <i>H</i> and no...

An <i>O</i> (<i>mn</i> log <i>n</i>) labeling algorithm is proposed for minimum sum of diameters bipartitioning of the vertex set of a weighted graph (with ...

In this paper we consider a minimax production planning model of a flexible manufacturing system with machines that are subject to random breakdown and repa...

This paper examines whether there is a substantial additional payoff to be derived from using mathematical optimization techniques to globally define a set ...

In this paper we consider a preventive maintenance and production model of a flexible manufacturing system with machines that are subject to breakdown and r...