Axis 2: Decision support made in complex systems
BackCahiers du GERAD
1422 results — page 50 of 72
Chemical graphs, as other ones, are <i>regular</i> if all their vertices have the same degree. Otherwise, they are <i>irregular</i> and it is of interest to...
BibTeX reference
We describe an approach that computes an optimal primal basic solution given an optimal vector of dual multipliers. It consists in restricting the dual prob...
BibTeX reference
This article presents a formulation for the job shop problem based on the Dantzig- Wolfe decomposition with a subproblem for each machine. Each subproblem i...
BibTeX reference
In most vehicle routing and crew scheduling applications solved by column generation, the subproblem corresponds to a shortest path problem with resource con...
BibTeX referenceA Primer in Column Generation
We give a didactic introduction to the use of the column generation technique in linear and in particular in integer programming. We touch on both, the relev...
BibTeX reference
This paper proposes a generalization of the proximal point algorithm using both penalty and trust region concepts. Finite convergence is established while as...
BibTeX reference
A new class of algorithms for solving nonlinearly constrained mixed variable optimization problems is presented. This class combines and extends the Audet-De...
BibTeX reference
This article reviews some of the best metaheuristics proposed in recent years for the Vehicle Routing Problem. These are based on local search, on populatio...
BibTeX reference
The uniting feature of combinatorial optimization and extremal graph theory is that in both areas one should find extrema of a function defined in most...
BibTeX reference
The problem of determining a shortest loop incident to each cell of a block layout is considered. A compact formulation is developed for this problem and a ...
BibTeX reference
Conjectures in graph theory have multiple forms and involve graph invariants, graph classes, subgraphs, minors and other concepts in premisses and/or conclu...
BibTeX reference
Computer-assisted and automated conjecture-making in graph theory is reviewed, focusing on the three operational systems GRAPH, Graffiti and AutoGraphiX (AGX...
BibTeX reference
We consider the multiple depot vehicle scheduling problem (MDVSP) and propose a branch-and-bound algorithm for solving it that combines column generation, va...
BibTeX reference
We consider a game where players face environmental constraints. We derive and compare noncooperative, cooperative and umbrella scenarios. In the latter, the...
BibTeX reference
This paper presents an overview of the modeling approaches that are used to represent, understand and control the interactions between the economy of a regio...
BibTeX reference
Allocution donnée par le professeur Georges Zaccour à la Société Royale du Canada, le vendredi 23 avril 2004, à HEC Montréal.
BibTeX reference
Two ways for bounding <i>n</i>-variables functions over a box, based on interval evalu- ations of first order derivatives, are compared. The optimal Baumann...
BibTeX reference
The shortest path problem with resource constraints consists of finding the minimum cost path between two specified points while respecting constraints on r...
BibTeX referenceExact and Heuristic Procedures for the Material Handling Circular Flow Path Design Problem
In this study we develop optimization, decomposition, and heuristic procedures to design a unidirectional loop flow pattern along with the pickup and delive...
BibTeX reference
We study whether the introduction of a private label could be profitable for retailers and manufacturers. We also investigate if cooperative advertising cou...
BibTeX reference