Axis 2: Decision support made in complex systems
BackCahiers du GERAD
1401 results — page 64 of 71
Examination timetabling is an important operational problem in many schools, colleges and universities. The authors have developed a computerized examinatio...
BibTeX reference
Cylindrical aromatic compounds - fullerenes and hydrocarbons - are about to become highly interesting objects of chemical research. A tubulene (tubular ben...
BibTeX reference
Given a set of logical sentences together with probabilities that these sentences are true, the probabilistic satisfiability (PSAT) problem consists, in it...
BibTeX reference
We present a method to compute valid concavity cuts for the linear maxmin programming problem. We consider a primal and a dual approach. In both cases the p...
BibTeX reference
A count of Kekulé structures for all 1812 distinct fullerene isomers of C<sub>60</sub> shows that 20 isomers surpass the count of 12500 for icosahedral C<su...
BibTeX reference
This paper presents methods to determine the optimal transfer batch sizes of various part types between two machines so as to minimize the sum of the total ...
BibTeX reference
This paper presents a new approach for planning the dispatching, conflict-free routing, and scheduling of automated guided vehicles in a flexible manufactur...
BibTeX reference
Crew-Opt is a set-covering method that uses column-generation to produce nearly optimal solutions to crew scheduling problems. We presented this method at t...
BibTeX reference
We consider the problem of finding a shortest path for a car-like robot (approximated by a point) maneuvering around obstacles. This robot is capable of for...
BibTeX reference
This survey paper describes the significant advances made in time constrained vehicle routing and crew scheduling problems. In terms of solution methodolog...
BibTeX reference
This paper examines whether there is a substantial additional payoff to be derived from using mathematical optimization techniques to globally define a set ...
BibTeX reference
This paper describes strip sequencing models for large scale traveling salesman problems arising in flexible manufacturing operations in two or three discre...
BibTeX referenceA New Branching Strategy for Time Constrained Routing Problems with Application to Backhauling
In this paper we explore a new branching strategy for branch-and-bound approaches based on column generation for the vehicle routing problems with time wind...
BibTeX reference
In this paper we analyze the efficiency of a given robot movement schedule for the case of a flowshop robotic production cell with <i>m</i> different machin...
BibTeX reference
It is well known that several combinatorial optimization problems can be nicely and readily modeled as an appropriate quadratic 0-1 function to be optimized...
BibTeX reference
In the Dual Bin Packing Problem (DBP), there are an unlimited number of bins of identical capacity, and unsplittable items of given weights. The aim is to ...
BibTeX reference
This paper propose a column generation method for optimally solving the rostering problem. Various strategies for accelerating the column generation process...
BibTeX reference
We consider the problem of defining a fair sharing of the total advantages gained by two regions (players) which decide to coordinate their environmental po...
BibTeX reference
The purpose of this paper is to formulate and solve an optimization problem arising in the operations of a numerical control machine such as a punch press. ...
BibTeX reference
In operations planning in an open pit mine an economic blocks model is generally used which attempts to determine which blocks will be extracted during each...
BibTeX reference