Axis 2: Decision support made in complex systems
BackCahiers du GERAD
1415 results — page 54 of 71
This paper describes a method for evaluating the kinetic constants in a rate expression for catalytic combustion applications using experimental light-off c...
BibTeX reference
This note addresses the issue of computation of the characteristic function values in a <i>n</i>-player linear-state cooperative differential game. One sho...
BibTeX reference
This article considers the (1|<i>X<sub>p</sub></i>-medianoid problem on a network <i>N</i>=(<i>V,E</i>) with vertex and edge demands. There are already <i>p...
BibTeX reference
In the <i>Maximum Cardinality Bin Packing Problem</i>, we are given <i>m</i> bins of capacity <i>c</i> and <i>n</i> items of weights <i>w<sub>i</sub></i> (...
BibTeX reference
This article reviews ten of the most important tabu search heuristics for the vehicle routing problem. Some of the main tabu search features are first desc...
BibTeX reference
The paper considers a channel of distribution consisting of a single manufacturer and retailer. The manufacturer advertises in national media, to build up t...
BibTeX reference
The purpose of this article is to describe several applications of the Clustered Traveling Salesman Problem arising in areas as diverse as vehicle routing, ...
BibTeX referenceComputers in Graph Theory
A survey is made of computer systems which help to obtain and sometimes provide automatically proofs, conjectures and refutations in graph theory.
BibTeX reference
This paper investigates several questions related to the location of facilities in multi-storey buildings in the presence of lifts. Where should facilities ...
BibTeX reference
In this paper we introduce a new formulation of the logistics network design problem encountered in deterministic, single-country, single-period contexts. O...
BibTeX reference
This paper investigates a new variation in the continuous single facility location problem. Specifically, we address the problem of locating a new facility...
BibTeX referenceOn Uniform k-Partition Problems
We study various uniform <i>k</i>-partition problems which consist in partitioning <i>m</i> sets, each of cardinality <i>k</i>, into <i>k</i> sets of cardin...
BibTeX referenceA General Multi-Shift Scheduling System
Rotating work schedules are encountered in several industries and public sector organizations where work is carried out 24 hours a day, seven days a week. ...
BibTeX reference
We survey computers systems which help to obtain and sometimes provide automatically conjectures and refutations in algebraic graph theory.
BibTeX referenceAnalysis of Generalized Pattern Searches
This paper contains a new convergence analysis for the Lewis and Torczon GPS class of pattern search methods for linearly constrained optimization. The ana...
BibTeX referencePanchromatic Chains and Paths
A generalization of the Roy-Gallai theorem on the chromatic number of a graph is derived which is also an extension of several other results of Berge and of...
BibTeX referenceIntegral Complete Split Graphs
We give characterizations of integral graphs in the family of complete split graphs and a few related families of graphs.
BibTeX reference
Variable neighborhood search (VNS) is a recent metaheuristic for solving combinatorial and global optimization problems whose basic idea is systematic chang...
BibTeX referenceAmbulance Location and Relocation Models
This article traces the evolution of ambulance location and relocation models proposed over the past thirty years. The models are classified in two main ca...
BibTeX reference
This paper introduces a new kind of operational crew scheduling problem which consists in simultaneously modifying, as necessary, the existing flight depart...
BibTeX reference