34 Cahiers pour l'année 1985
Vehicle Routing with Full Loads
This paper considers a vehicle routing problem with full loads and time limit constraints. This problem can be formulated as an asymmetrical travelling sale...
référence BibTeXA Branch-and-Bound Algorithm for the Asymetrical Distance Constrained Vehicle Routing Problem
The aim of this paper is to develop an exact algorithm for the asymmetrical distance constrained vehicle routing problem. The problem is solved by means of ...
référence BibTeX
This paper presents an exact algorithm for a generalized version of the Travelling Salesman Problem which consists of finding the shortest Hamiltonian cirnui...
référence BibTeX
This report gives a general presentation of the Québec energy system modelling realized through the MARKAL formalism, and aimed at the implementation of a sy...
référence BibTeX
This report presents and documents the process technologies (PRC) included in the energy model MARKAL-QUÉBEC. The most important characteristics of the ener...
référence BibTeX
This report presents technical and economic data describing electric generation technologies in the world and in Québec. The particular situation of Québec ...
référence BibTeX
This report presents, with great details, a model of crude oil refineries in Quebec. The modelisation was made inside the global energy model MARKAL and the...
référence BibTeX
The aim of this report is to present recent developments in the modelling of industrial energy use within a global energy system model for the Province of Qu...
référence BibTeX
In this report, we deal with the assessment of energy technologies using the MARKAL model. Severals methods of evaluating the relative merits of technologie...
référence BibTeX
This paper consists in a preliminary study for the assessment of the advantages and feasibility of a regionalized energy model for Canada, based on the MARKA...
référence BibTeX
The concept of ϵ-sequential Stackelberg equilibrium is introduced in the general framework of dynamic two-person games defined in the Denardo contracti...
référence BibTeX
This paper presents a survey of exact algorithms for various types of vehicle routing problems. Algorithms are divided into three main categories: direct s...
référence BibTeX
This paper examines a family of permutation problems on 0-1 matrices. These problems arise in scheduling and in archaeological seriation. Three exact algor...
référence BibTeX
Cet article décrit dive3rs types d'horaires de travail en vigueur dans les entreprises et les services publics, ainsi que les principales méthodes de recherc...
référence BibTeX
This paper presents some preliminary results from an ongoing study of the impact of various operating scenarios on the construction and quality of reoutes in...
référence BibTeX
Various algorithms for numerical solutions of discounted stochastic games are presented. For zero-sum two-person games, the existing algorithms are compared...
référence BibTeXLe traitement des exigences rigides et souples dans certains problèmes d'optimisation combinatoire
Le présent article décrit des méthodes algorithmiques de traitement des exigences rigides et souples dans certains problèmes complexes d'optimisation combina...
référence BibTeX
One considers a differential game model of capitalism "à la Lancaster". Feedback Nash equilibria and Pareto optimal solutions are characterized under the as...
référence BibTeX
A Travelling Salesman Problem in a three-dimensional spatial domain is associated with a scheduling problem encountered in a flexible manufacturing cell incl...
référence BibTeX
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...
référence BibTeX
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...
référence BibTeX
This paper examines some properties of generalized subtour elimination constraints and connectivity constraints used in a variety of routing problems.
référence BibTeX
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...
référence BibTeX
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...
référence BibTeX
In some universities, complete course schedules are made available to students at the time of registration. Typically these schedules give the room number, ...
référence BibTeX
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...
référence BibTeX
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...
référence BibTeX
The steeling workshop of SIDBEC in Contrecoeur consists of four electric arc furnaces which share some limited energy and material resources. Such limitatio...
référence BibTeX
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...
référence BibTeXDefinition and Properties of Cooperative Equilibria in a Two-Player Game of Infinite Duration
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...
référence BibTeX
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...
référence BibTeX
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...
référence BibTeX
Applied to strongly monotone variational inequality problems, Newton's algorithm achieves local quadratic convergence. However, global convergence cannot be...
référence BibTeXFinding the Shortest Hamiltonian Circuit Through n Clusters: A Lagrangean Relaxation Approach
This paper deals with a generalized version of the Travelling Salesman Problem which consists of finding the shortest Hamiltonian circuit through n clusters,...
référence BibTeX