Cahiers du GERAD
Recherche
Liste chronologique
3082 résultats — page 144 de 155
Un ensemble d'algorithmes permettant de confectionner les itinéraires et l'horaire des véhicules en vue du transport de personnes handicapées est présenté. ...
référence BibTeX
In this paper a study of Second and Third Degree Stochastic Dominances for the family of concave and convex utility functions is proposed. This is a modific...
référence BibTeX
Schedule compression is a major concern in project management. We propose an extension of the classical crashing model to include the managerial practice of...
référence BibTeX
We investigate the complexity of openshop scheduling problems. A number of variations of the shop with different objective functions have been surveyed. The...
référence BibTeX
Global optimization problems with a few variables and constraints arise in numerous applications but are seldom solved exactly. Most often only a local opti...
référence BibTeX
We consider the problem of scheduling jobs on a single machine with generalized due dates. The due dates are given according to the position in which a job ...
référence BibTeX
The aim of this paper is the characterization and the computation of equilibrium solutions in multistage games represented by networks. More specifically, w...
référence BibTeX
The transient statistical evolution of a single product manufacturing system under hedging point control policies is characterized via a system of coupled p...
référence BibTeX
This paper shows how the subtour elimination constraints developed by Miller, Tucker and Zemlin for the traveling salesman problem can be improved and exten...
référence BibTeX
Consider the optimal control problem for the two processor flow-shop when processing time is a (linear) function of the state. Since the latter also depends...
référence BibTeX
The interaction between a utility company and electricity cogenerators is modeled via a game-theoretic, systems analysis approach, under the assumption of a...
référence BibTeX
We consider projects represented by a PERT network, with convex cost-of-time functions on individual activities, and we show the existence of an efficient m...
référence BibTeX
The multiple vehicle many-to-many routing problem is presented in the context of a dial-a-ride system. It is solved by mini-clustering first and optimal ro...
référence BibTeX
We present an algorithm that solves the problem of finding the vehicle schedule which minimizes total inconveniences for travel along a fixed path, where se...
référence BibTeX
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...
référence BibTeX
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...
référence BibTeX
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...
référence BibTeX
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...
référence BibTeXOn 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...
référence BibTeX
This paper deals with an application of the projective algorithm to the solution of a generic nondifferentiable minimization problem. This problem is closel...
référence BibTeX