Axis 2: Decision support made in complex systems
BackCahiers du GERAD
1368 results — page 53 of 69
During the last decade, reverse logistics has been introduced into the manufacturing language. Companies' and public's awareness of environmental issues are...
BibTeX referenceThe Largest Small Octagon
Thrackleation of graphs and global optimization for quadratically constrained quadratic programming are used to find the octagon with unit diameter and larg...
BibTeX reference
Proposed just a few years ago, Variable Neighborhood Search (VNS) is a new metaheuristic for combinatorial and global optimization, based upon systematic ch...
BibTeX reference
This paper solves the problem of designing an access tree network for which the users are connected to the switches through SONET channels on fiber optics l...
BibTeX reference
Reduction of some classes of global optimization programs to bilinear programs may be done in various ways, and the choice of method clearly influences the ...
BibTeX reference
In the literature, thermal insulation systems with a fixed number of heat intercepts have been optimized with respect to intercept locations and temperature...
BibTeX reference
This paper addresses the problem whether a cooperative agreement, made at the start of a game, can be sustained over time. The players can reopen negotiatio...
BibTeX reference
The Esau-Williams algorithm is one of the best known heuristics for the Capacitated Minimum Spanning Tree Problem. This research note describes a simple en...
BibTeX referenceAn Optimization Model for the Simultaneous Operational Flight and Pilot Scheduling Problem
This paper describes and solves the operational pilot scheduling problem for one day of operations. The problem consists in simultaneously modifying, as nec...
BibTeX reference
On the basis of a variable-neighbourhood search with the AutoGraphiX software, it is conjectured that for even numbers of atoms the fully conjugated acycli...
BibTeX referenceLocation-Arc Routing Problems
<i>Location-Arc Routing Problems</i> (LARPs) are encountered in contexts where it is necessary to simultaneously determine a traversal of a subset of edges ...
BibTeX referenceStable Sets and Chromatic Number
A generalization of the Roy-Gallai theorem is presented: it is based on the existence in any oriented graph of a stable set S such that for any node <i>w</i...
BibTeX reference
Maximum Clique is one of the most studied NP-hard optimization problem on graphs because of its simplicity and its numerous applications. A basic Variable N...
BibTeX reference
An algorithm with a complexity linear in the number of vertices is proposed for the computation of the Hyper-Wiener index of chemical trees. This complexity...
BibTeX referenceRecherche à Voisinage Variable
La Recherche à Voisinage Variable (RVV) est une métaheuristique récente basée sur l'idée d'un chargement systématique de voisinage, à la fois dans une phase...
BibTeX reference
This paper considers the problem of locating a facility not among demand points, as is usually the case, but among demand regions which could be market area...
BibTeX reference
We consider the problem of locating a line or a line segment in three-dimensional space, such that the sum of distances from the facility represented by the...
BibTeX referenceAn Oil Pipeline Design Problem
We consider a given set of offshore platforms and onshore wells, producing known (or estimated) amounts of oil, to be connected to a port. Connections may t...
BibTeX reference
Given a set of logical sentences and probabilities that these sentences are true, the probabilistic logic problem consists in determining whethe...
BibTeX reference
Variable Neighborhood Search (VNS) is a recent metaheuristic which exploits systematically the idea of change of neighborhood within the search. After recal...
BibTeX reference