Axis 2: Decision support made in complex systems
BackCahiers du GERAD
1401 results — page 65 of 71
Given a binary matrix <i>E</i>, the Seriation Problem consists of determining a permutation of the rows of <i>E</i> minimizing the sum over all columns of t...
BibTeX reference
The majority of the examination timetabling software programs available today suffer from one of the following drawbacks: either the techniques are not very...
BibTeX reference
We consider a price setting duopoly producing differentiated goods, where the players can learn by doing and from each other. The unit production cost is mo...
BibTeX reference
We consider the problem of finding a shortest path for a car-like robot maneuvering in a convex cell. This robot, capable of forward and backward motion, is...
BibTeX reference
We study the problem of finding a shortest path for a car-like mobile robot with a minimal turning radius constraint. This vehicle can move either forward o...
BibTeX reference
This paper deals with the modeling of economy-environment interactions for several countries which are assumed to behave competitively for the control of th...
BibTeX reference
The stochastic linear programming problem with recourse has a dual block angular structure. It can thus be handled by Benders decomposition or by Kelley's m...
BibTeX reference
This paper presents the development of a new optimal dynamic programming algorithm for the minimization of the total traveling cost for the traveling salesm...
BibTeX reference
We give a new formulation to the multiple-depot vehicle scheduling problem as a set partitioning problem with side constraints, whose continuous relaxation ...
BibTeX reference
The NP-hard problem addressed in this paper is well known in the scheduling literature as <i>R</i>|<i>C</i><sub><font size=-1>max</font></sub>. We introduce...
BibTeX reference
The problem of finding a minimal length trajectory (MLT) for a mobile robot has changed in the last five years, as vehicle kinematics have come to be taken ...
BibTeX referenceSpine Layout Design
We present a method for designing spine layouts. A spine layout is a layout in which a main aisle is used for the movements between the work cells located o...
BibTeX reference
In this paper, optimal strip strategies are developed for a variety of two-dimensional and three-dimensional sequencing problems arising in flexible manufac...
BibTeX reference
We present a new two-commodity flow formulation for the traveling salesman problem. Each commodity corresponds to a resource that is either distributed or p...
BibTeX reference
We consider a differential game model to investigate the effects of price subsidy over time on the rate of diffusion of a new technology. We assume that the...
BibTeX reference
In this paper, the expected distance between two uniformly distributed random points in a rectangle or in a rectangular parallelepiped is computed under thr...
BibTeX reference
Examination scheduling is a problem in virtually every high school, college and university. The basic challenge is to schedule examinations over a limited ...
BibTeX reference
Layout planning is an appropriate area in which to apply optimization models. A method is proposed here for evaluating general layouts (block layouts) when ...
BibTeX reference
This paper deals with the implementation of the interior point cutting plane algorithm of Goffin-Haurie-Vial, with a special application to the solution of ...
BibTeX reference
The Airline Crew Scheduling Problem can be defined as the problem of finding a set of feasible rotations so that the total cost is minimum and all the fligh...
BibTeX reference