Axe 2 : Aide à la décision prise dans les systèmes complexes
RetourCahiers du GERAD
1401 résultats — page 62 de 71
We consider the problem of minimizing, over a fixed horizon, the peak load in single-command cycle dedicated storage policies. The daily load is the expecte...
référence BibTeX
The multi-depot vehicle scheduling problem with time windows consists of scheduling a fleet of vehicles to cover a set of tasks at minimum cost. Each task i...
référence BibTeXProbabilistic Satisfiability
A review is made of models and algorithms for probabilistic satisfiability and its extensions. The basic probabilistic satisfiability problem, in decision f...
référence BibTeX
Extension of input-output functions for generating units allows simultaneous solution of the static unit commitment and economic dispatch problems by dynami...
référence BibTeX
Let <i>G =</i> (<i>V,E</i>) be an undirected graph and <i>c</i> any vector in Z<sub>+</sub><sup><i>V</i>(<i>G</i>)</sup>. Denote by <img src="chi.gif" alig...
référence BibTeX
In the Generalized Traveling Salesman Problem (GTSP), the aim is to determine a least cost Hamiltonian circuit or cycle through several clusters of vertic...
référence BibTeX
The problem of assigning locomotives to train-segments is very important for railway companies, in view of the high cost of operating locomotives. The prob...
référence BibTeX
This paper presents an optimal dynamic programming algorithm, the first such algorithm in the literature to solve the shortest path problem with time window...
référence BibTeXCrew Pairing at Air France
In the airline industry, crew schedules consist of a number of pairings. These are round trips originating and terminating at the same crew home base compo...
référence BibTeX
We give lower and upper bounds for the number of reducible ears as well as upper bounds for the number of perfect matchings in an elementary bipartite graph...
référence BibTeX
The maxmin problem models a game sequentially played by two players having opposite objective. Before making his move, the first player must anticipate the...
référence BibTeXMixed Graph Colorings
A mixed graph <i>G<sub><img src="theta.gif"></sub></i> contains both undirected edges and directed arcs. A <i>k</i>-coloring of <i>G<sub><img src="theta.g...
référence BibTeX
The majority of vehicle routing and crew scheduling problems studied up to date in the literature can be formulated by means of a unified model introduced b...
référence BibTeX
A government wishes to accelerate the adoption of a new technology in order to gradually replace an older one. The new technology is manufactured by a mono...
référence BibTeX
We study links between the bilevel linear and linear mixed 0-1 programming problems. A new reformulation of the linear mixed 0-1 programming problem into a...
référence BibTeX
In this paper we derive lower bounds on the size of a minimum cover of a graph <i>G</i> by computing packings of edges, odd cycles and cliques of <i>G</i> o...
référence BibTeX
In this paper we tackle the problem of jointly finding the optimal location of the ATM switches, the topology of the backbone and local access networks, the...
référence BibTeX
Multiobjective decision making problems occur in a variety of transportation planning settings. These are often ill-defined and may involve several players...
référence BibTeX
The <i>p</i>-maxisum dispersion problem consists of locating <i>p</i> facilities at vertices of a network in order to maximize the sum of the distances betw...
référence BibTeXSplitting Trees
Splitting a tree is defined as removing all edges of a chain and disconnecting one from the other edges incident with that chain. Splitting a forest is simu...
référence BibTeX