Cahiers du GERAD
Search
Chronological list
3159 results — page 156 of 158
This paper provides integer linear programming formulations for three types of vehicle routing problems. Appropriate relaxations of these formulations lend ...
BibTeX reference
Consider a set of trips where each trip is specified a priori by a place of origin, a destination, a duration, a cost and a time interval within which the tr...
BibTeX referenceOptimal Control of an Age-Structured Population Model with Applications to Social Services Planning
The aim of this paper is to propose a deterministic model designed for the analysis of social services policies directed toward large populations. The model...
BibTeX referenceFonte et affinage du zinc
Ce rapport a pour but de fournir une description plus précise des technologies utilisées dans l'industrie du zinc en considérant un ensemble d'activités cara...
BibTeX reference
The variational inequality problem can be formulated as a nonconvex, nondifferentiable optimization problem. We show that this formulation leads to a conver...
BibTeX reference
This paper provides an integer linear programming formulation for a class of multidepot vehicle routing problems. This formulation contains degree constrain...
BibTeX reference
Bus fleet route planning is often carried out in the following two sequential stages:<br> 1) Based on the demand, determine the trips to be carried out.<br>...
BibTeX referenceFonte et affinage du cuivre
Ce rapport a pour but de fournir une description plus précise des technologies utilisées dans l'industrie du cuivre en considérant un ensemble d'activités ca...
BibTeX reference
Ce rapport a pour but de fournir une description plus précise des technologies utilisées dans l'industrie des scories de titane en considérant un ensemble d'...
BibTeX reference
In this article, two Lagrangean relaxations for the vehicle routing problem with time windeow constraints are examined. In the first case, the scheduling co...
BibTeX reference
Recently much attention has been focused on multilevel programming, a branch of mathematical programming that can be viewed either as a generalization of min...
BibTeX reference
The deepest, or least shallow, cut ellipsoid method is a polynomial (time and space) method which finds an ellipsoid, representable by polynomial space integ...
BibTeX reference
A two country differential game mode of whaling is used for analysing a dynamic bargaining problem. At a given initial time, the two countries may either co...
BibTeX reference
A two-country fishery management game is considered in the realm of the theory of non-cooperative and cooperative differential games. Conditions which guara...
BibTeX reference
Les modèles développés jusqu'à maintenant dans le domaine urbain, que ce soient les modèles économétriques ou encore les modèles déterministes de simulation,...
BibTeX referenceL'Industrie du ciment au Québec
Ce rapport a pour but de fournir une description plus précise des technologies utilisées dans l'industrie du ciment en considérant un ensemble d'activités ca...
BibTeX reference
A non-cooperative game is formulated on a transportation network with congestion. The players are associated with origin-destination pairs, and are facing d...
BibTeX reference
Consider a set of trips where each trip is specified a priori by a place of origin, a destination, a duration, a cost and a time interval within which the tr...
BibTeX reference
Le problème du voyageur de commerce (PVC) symétrique consiste à déterminer le cycle le plus court passant exactement une fois par chacun des noeuds d'un grap...
BibTeX reference
This paper consider the problem of determining the shortest circuit or cycle in a graph containing n nodes and such that (i) each of k nodes (k ≤ n) i...
BibTeX reference