Axis 2: Decision support made in complex systems

Back

Cahiers du GERAD

1453 results — page 55 of 73

, , , and

We develop and analyze parallelization strategies for the Variable Neighborhood Search (VNS) meta-heuristic applied to the <i>p</i>-median problem. The stra...

BibTeX reference
and

Albertson (1997) defines the <i>imbalance</i> of an edge (<i>i,j</i>) in <i>E</i> of a graph <i>G</i> = (<i>V,E</i>) as | <i>d<sub>i</sub> - d<sub>j</sub></...

BibTeX reference
, , and

The paper analyzes a differential game model of a two-member marketing channel. A manufacturer invests in national advertising with the purpose of improving ...

BibTeX reference
, , and

La majorité des auteurs traitant du problème de design d'implantation d'usine considèrent que la sélection de la configuration du réseau de manutention est f...

BibTeX reference

Le texte qui suit est l'allocution donnée par le professeur Jacques Desrosiers à la Société Royale du Canada, le jeudi 14 novembre 2002, à l'Université du Qu...

BibTeX reference
, , and

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
, , and

The paper identifies conditions under which time-consistency and agreeability, two intertemporal individual rationality concepts, can be verified in linear-s...

BibTeX reference
and

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
, , , and

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
, , and

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 reference
and

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
, , and

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
, , and

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
and

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
, , , and

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