Cahiers du GERAD
Search
Chronological list
3128 results — page 147 of 157
This paper establishes a relationship between the concept of hedging point, first introduced in the realm of FMS flow control models, and the turnpike prop...
BibTeX reference
We outline a system that is being designed to support the modeling of physical distribution situations and the selection or construction of algorithms for t...
BibTeX reference
In this paper, we address the problem of routing a fleet of vehicles from a central depot to customers with known demands. We consider the classical vehicle...
BibTeX reference
Piyavskii's algorithm maximizes a univariate function <i>f</i> satisfying a Lipschitz condition. We compare the numbers of iterations needed to obtain a bou...
BibTeX referenceOn the Computation of Weighted Analytic Centers and Dual Ellipsoids with the Projective Algorithm
The primal projective algorithm for linear programs with unknown optimal objective function value is extended to the case where one uses a weighted Karmarka...
BibTeX reference
This paper deals with an application of the projective algorithm to the solution of a generic nondifferentiable minimization problem. This problem is closel...
BibTeX reference
Le problème classique d'optimisation de la capacité des réseaux de télécommunications s'énonce comme suit: pour un réseau dont la structure, la demande et l...
BibTeX reference
Several single-commodity, two-commodity and multi-commodity flow formulations have recently been introduced for the travelling salesman problem. The purpose...
BibTeX reference
A certain sequential separability property is established, using a topological argument, and exploiting a convexity-type assumption about objects with direc...
BibTeX reference
In this paper, we present general formulations for the stochastic vehicle routing problem with capacity restrictions in which the <i>m</i> vehicle tours hav...
BibTeX reference
Given a weighted graph with profits associated with the vertices, the selective travelling salesman problem (or orienteering problem) consists of selecting ...
BibTeX reference
This paper presents a linear programming model of the Quebec and New York State power systems which includes a detailed description of the different types o...
BibTeX reference
Consider the optimal control problem for the two processor flow-shop when processing times for <i>n</i> tasks are (linear) functions of the state. Since th...
BibTeX reference
In this paper a study on Second and Third degree Stochastic Dominances for the family of concave and convex utility functions is proposed. This is the LDEU...
BibTeX reference
La programmation mathématique à plusieurs niveaux permet de modéliser adéquatement certaines structures de décision hiérarchisées. Cette thèse contribue au ...
BibTeX reference
In this paper, we deal with the problem of scheduling parts and robot moves in a roboic cell where the robot is used to feed machines in the cell. The robo...
BibTeX reference
Consider <i>N</i> entities to be classified, and a matrix of dissimilarities between pairs of them. The split of a cluster is the smallest dissimilarity be...
BibTeX referenceLa modélisation analytique du transport porte-à-porte et ses applications au transport adapté
This report proposes some approximate analytical models allowing the evaluation of the average service time for a user of a door-to-door transportation syst...
BibTeX reference
This research review presents very recent results in the theory of deterministic scheduling in production systems. The deterministic models dealt with inclu...
BibTeX reference
The object of this study is to solve a resource sharing problem. One considers a surgery ward with a fixed number of beds. A team of surgeons is sharing th...
BibTeX reference