Axe 2 : Aide à la décision prise dans les systèmes complexes
RetourCahiers du GERAD
1412 résultats — page 61 de 71
Consider a set <i>L</i> of potential locations for <i>p</i> facilities and a set <i>U</i> of locations of given users. The <i>p</i>-median problem is to loc...
référence BibTeXPath, Tree and Cycle Location
<i>Extensive facilities</i> are structures that are too large to be considered as single points. In the first part of this paper we propose integer program...
référence BibTeX
Multi-commodity flow models are well known and have been widely used in the design of packet-switched networks. They have also been used as approximations ...
référence BibTeX
We study the set of lower bounds which have been proposed for the numbering of a complete graph. We first show that the computation of most of them can be ...
référence BibTeX
We consider a managerial economics problem of controlling pollution caused by decentralised agents. We build a mathematical model for a local government ai...
référence BibTeXCovering 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...
référence BibTeX
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...
référence BibTeX
This paper introduces a new type of constraints, related to schedule synchronization, in the problem formulation of aircraft fleet assignment and routing pr...
référence BibTeX
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...
référence BibTeX
This paper classifies research contributions on decomposition approach for solving mathematical programming problems. More than 60 papers are presented with...
référence BibTeX
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...
référence BibTeX
In recent years, there have been several important algorithmic developments for the traveling salesman problem and the vehicle routing problem. These inclu...
référence BibTeX
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 ...
référence BibTeX
We consider a weekly locomotive scheduling problem encountered at Swedish State Railways. The objective is to find cyclic locomotive schedules, which minim...
référence BibTeXNesticity
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...
référence BibTeX
The purpose of this paper is to develop optimal tool partitioning policies and strip sequencing strategies for a class of flexible manufacturing problems. ...
référence BibTeX
This paper describes the operational airline crew scheduling problem and represents a first published attempt to solve it. This problem consists of modifyin...
référence BibTeX
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...
référence BibTeX
This paper formulates the problem of maximal closure on a graph with resource constraints as an integer programming problem with binary variables, and propo...
référence BibTeX
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...
référence BibTeX