Axe 2 : Aide à la décision prise dans les systèmes complexes
RetourCahiers du GERAD
1368 résultats — page 53 de 69
During the last decade, reverse logistics has been introduced into the manufacturing language. Companies' and public's awareness of environmental issues are...
référence BibTeXThe 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...
référence BibTeX
Proposed just a few years ago, Variable Neighborhood Search (VNS) is a new metaheuristic for combinatorial and global optimization, based upon systematic ch...
référence BibTeX
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...
référence BibTeX
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 ...
référence BibTeX
In the literature, thermal insulation systems with a fixed number of heat intercepts have been optimized with respect to intercept locations and temperature...
référence BibTeX
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...
référence BibTeX
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...
référence BibTeXAn 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...
référence BibTeX
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...
référence BibTeXLocation-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 ...
référence BibTeXStable 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...
référence BibTeX
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...
référence BibTeX
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...
référence BibTeXRecherche à 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...
référence BibTeX
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...
référence BibTeX
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...
référence BibTeXAn 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...
référence BibTeX
Given a set of logical sentences and probabilities that these sentences are true, the probabilistic logic problem consists in determining whethe...
référence BibTeX
Variable Neighborhood Search (VNS) is a recent metaheuristic which exploits systematically the idea of change of neighborhood within the search. After recal...
référence BibTeX