Axis 2: Decision support made in complex systems
BackCahiers du GERAD
1368 results — page 51 of 69
Generalized logical analysis aims at modelling complex biological systems, especially the so-called regulatory systems like genetic networks. The main feat...
BibTeX reference
This article describes a tabu search heuristic for the <i>Dial-a-Ride Problem</i> with the following characteristics. Users specify transportation requests ...
BibTeX reference
The convergence theory of generalized pattern search algorithms for unconstrained optimization guarantees under mild conditions that the method produces a li...
BibTeX reference
The paper identifies conditions under which time-consistency and agreeability, two intertemporal individual rationality concepts, can be verified in linear-s...
BibTeX reference
We consider a new variant of constrained shortest path problem, where the constraints come from a set of forbidden paths (arc sequences) that cannot be part...
BibTeX reference
The <i>Dial-a-Ride Problem</i> (DARP) consists of designing vehicle routes and schedules for <i>n</i> users who specify pick-up and drop-off requests betwee...
BibTeX reference
In the undirected <i>Hierarchical Chinese Postman Problem</i> (HCPP), the edges of a graph are partitioned into clusters and must be serviced while respecti...
BibTeX reference
The <i>Job Sequencing and Tool Switching Problem</i> (SSP) involves optimally sequencing jobs and assigning tools to a capacitated magazine in order to mini...
BibTeX referenceVariable Neighborhood Search for Extremal Graphs. 6. Analyzing Bounds for the Connectivity Index
Recently, Araujo and De la Pena (1998) gave bounds for the connectivity index of chemical trees as a function of this index for general trees and the ramifi...
BibTeX reference
The pooling problem, which is fundamental to the petroleum industry, describes a situation where products possessing different attribute qualities are mixed...
BibTeX reference
We prove that amongst all fullerenes the dodecahedron has maximum smallest eigenvalue (equal to -<img src="G0234-1.gif" align=middle>), followed by the thre...
BibTeX reference
A common question asked by users of direct search algorithms is how to use derivative information at iterates where it is available. This paper addresses th...
BibTeX reference
The paper identifies optimal dynamic marketing strategies in a channel of distribution. A number of (identical) retailers promote locally a manufacturer's b...
BibTeX reference
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 reference