This paper examines some properties of generalized subtour elimination constraints and connectivity constraints used in a variety of routing problems.

People who attend several meetings on the same day often have unusable pieces of free time between meetings. These can be reduced or eliminated through bett...

In this paper a minimax location problem in the plane is described where it is the objective to minimize the largest flow at any point in the plane. Solutio...

In consumer theory, each good and its price may be considered conjugate. However, it is not clear which good is conjugate to the budget, or which dual varia...

Cet ouvrage présente le résultat d'une recherche de plus de deux années, subventionnée par le fond FCAC (Action spontanée), l'Ecole des Hautes Etudes Commerc...

In some universities, complete course schedules are made available to students at the time of registration. Typically these schedules give the room number, ...

In location-routing problems, the objective is to locate one or many depots within a set of sites (representing customer locations or cities) and to construc...

The aim of this paper is to develop an exact algorithm for the asymmetrical capacitated vehicle routing problem, i.e. the multiple travelling salesman proble...

Ce rapport décrit un modèle de planification tactique pour l'amélioration de l'industrie du camionnage au Canada. après une brève description du problème, o...

The steeling workshop of SIDBEC in Contrecoeur consists of four electric arc furnaces which share some limited energy and material resources. Such limitatio...

A two-player multistage game, with an infinite number of stages is considered. The concepts of overtaking and weakly-overtaking pay-off sequences are introd...

Applied to strongly monotone variational inequality problems, Newton's algorithm achieves local quadratic convergence. However, global convergence cannot be...

The aim of these notes is to give a comprehensive presentation of the recently developed theory of optimal control of non linear dynamic systems defined on u...

This paper deals with a class of equilibria for differential games in which memory strategies are allowed. This class permits the inclusion of a threat in a...

This paper deals with a generalized version of the Travelling Salesman Problem which consists of finding the shortest Hamiltonian circuit through n clusters,...

This paper describes algorithmic approaches for dealing with fuzziness in some highly structured combinatorial problems. A general framework is described an...

Some earlier results on k-star constraints and comb inequalities are generalized.

This paper deals with a modified version of the Lancaster model of capitalism, where it is assumed that there is a cost jointly beared by the two groups of p...

L'objectif de l'étude est d'évaluer l'impact sur les choix résidentiels de certains changements structurels tels les modifications dans la composition de la ...

This paper deals with a class of large-scale stochastic control problems typically associated with the maintenance of complex systems. For these systems the...