Axis 2: Decision support made in complex systems
BackCahiers du GERAD
1368 results — page 59 of 69
We consider a managerial economics problem of controlling pollution caused by decentralised agents. We build a mathematical model for a local government ai...
BibTeX referenceCovering a Graph with Cycles
This article describes a lower bounding procedure and heuristics for the <i>Cycle Cover Problem</i> which consists of determining a least cost cover of an u...
BibTeX reference
Good heuristic solutions for large Multisource Weber problems can be obtained by solving related <i>p</i>-median problems in which potential locations of th...
BibTeX reference
This paper introduces a new type of constraints, related to schedule synchronization, in the problem formulation of aircraft fleet assignment and routing pr...
BibTeX reference
An econometric model is developed and used to estimate price promotion effects on sales for the yogourt category in a Quebec market. More specifically, the...
BibTeX reference
This paper classifies research contributions on decomposition approach for solving mathematical programming problems. More than 60 papers are presented with...
BibTeX reference
This paper contains some 80 annotated references on the vehicle routing problem. The titles are organized as follows: 1) the classical VRP with capacity an...
BibTeX reference
In recent years, there have been several important algorithmic developments for the traveling salesman problem and the vehicle routing problem. These inclu...
BibTeX reference
The multisource Weber problem is to locate simultaneously <i>m</i> facilities in the Euclidean plane in order to minimize the total transportation cost for ...
BibTeX reference
We consider a weekly locomotive scheduling problem encountered at Swedish State Railways. The objective is to find cyclic locomotive schedules, which minim...
BibTeX referenceNesticity
A hypergraph <i>H=(X,E)</i> is <i>nested</i> if its edges are pairwise disjoint or included one into the other. The <i>nesticity</i> of <i>H</i> is defined...
BibTeX reference
The purpose of this paper is to develop optimal tool partitioning policies and strip sequencing strategies for a class of flexible manufacturing problems. ...
BibTeX reference
This paper describes the operational airline crew scheduling problem and represents a first published attempt to solve it. This problem consists of modifyin...
BibTeX reference
Given a set of entities, Cluster Analysis aims at finding subsets, called clusters, which are homogeneous and/or well separated. As many types of clusterin...
BibTeX reference
This paper formulates the problem of maximal closure on a graph with resource constraints as an integer programming problem with binary variables, and propo...
BibTeX reference
La méthode de génération de colonnes est couramment utilisée pour résoudre des problèmes d'optimisation de grande taille. En pratique, on observe fréquemmen...
BibTeX reference
We study both the continuous and discrete problems of maximizing the product of two linear functions subject to all variables being between 0 and~1. We fir...
BibTeX reference
Cet article présente une étude comparative des algorithmes de flot maximum pour la résolution du problème de fermeture maximale sur un graphe. Plusieurs ap...
BibTeX reference
It is shown that the anytime deduction procedure for probabilistic entailment of Frisch and Haddawy does not have the correctness property when the probabil...
BibTeX reference
Clustering with a criterion which minimizes the sum of squared distances to cluster centroids is usually done in a heuristic way. An exact polynomial algori...
BibTeX reference