Axis 2: Decision support made in complex systems
BackCahiers du GERAD
1368 results — page 61 of 69
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...
BibTeX reference
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...
BibTeX reference
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...
BibTeX reference
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...
BibTeX reference
Multiobjective decision making problems occur in a variety of transportation planning settings. These are often ill-defined and may involve several players...
BibTeX reference
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...
BibTeX referenceSplitting 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...
BibTeX reference
Local descent methods typically employ a single neighbourhood structure to conduct the search around a candidate solution. In this paper, we propose a metho...
BibTeX reference
In 1986, Carter published a survey of papers on practical examination timetabling. In the intervening years, there have been a number of new applications, ...
BibTeX reference
Nous nous penchons sur la modélisation et le traitement de problèmes d'entreposage du type partagé. Nous supposons que l'entrepôt est à charge unitaire et q...
BibTeX reference
Cluster Analysis is at the crossroad of many disciplines, and has numerous and diverse methods and applications. Mathematical Programming (together with gra...
BibTeX reference
Several heuristic methods have been developed to solve the location-allocation problem in continuous space. Typically, these algorithms attempt to move in d...
BibTeX reference
In this paper we consider the daily aircraft routing and scheduling problem (DARSP). It consists of determining daily schedules which maximize the anticipat...
BibTeX reference
We present a recent optimization approach that can be applied equally to aircraft routing, crew pairing generation and bidding/rostering problems arising in...
BibTeX reference
L'entreposage partagé, contrairement à l'entreposage dédié, permet qu'un emplacement du palettier reçoive des unités de différents produits ou classes de pr...
BibTeX reference
The purpose of this paper is to develop optimal tool partitioning policies and strip sequencing strategies for a class of flexible manufacturing problems su...
BibTeX reference
This paper reviews genetic algorithms and evolution systems and describes implementation of an evolution system to solve the QAP. Extensive search to select...
BibTeX reference
There are several routing and scheduling problems faced by airline companies, notably, aircraft scheduling, pairing generation and crew bidding and rosterin...
BibTeX reference
The multi-source Weber problem requires locating <i>m</i> new facilities in continuous space in order to minimize a sum of transportation costs to <i>n</i> ...
BibTeX reference
Ce document porte sur la fonction entreposage en général et sur les méthodes de rangement en particulier. Il est divisé en deux chapitres. Dans le premier c...
BibTeX reference