Cahiers du GERAD
Recherche
Liste chronologique
3179 résultats — page 103 de 159
A 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...
référence BibTeX
This paper proposes a generalization of the proximal point algorithm using both penalty and trust region concepts. Finite convergence is established while as...
référence BibTeX
A new class of algorithms for solving nonlinearly constrained mixed variable optimization problems is presented. This class combines and extends the Audet-De...
référence BibTeX
This paper presents an enumeration algorithm based on dynamic programming for optimally solving the fleet management problem in underground mines. This probl...
référence BibTeX
This paper deals with the stabilization problem of the class of uncertain stochastic hybrid systems with multiplicative noise. The uncertainties are norm bou...
référence BibTeX
We consider a differentiated duopoly where firms invest in research and development (R&D) to reduce their production cost. We show that if the firms pl...
référence BibTeX
This is the second part of a four-part survey of optimization models and solution algorithms for winter road maintenance planning. The first part addresses s...
référence BibTeX
Winter road maintenance operations involve a host of decision-making problems at the strategic, tactical, operational, and real-time levels. Those operations...
référence BibTeX
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...
référence BibTeX
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...
référence BibTeX
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 ...
référence BibTeX
Conjectures in graph theory have multiple forms and involve graph invariants, graph classes, subgraphs, minors and other concepts in premisses and/or conclu...
référence BibTeX
Computer-assisted and automated conjecture-making in graph theory is reviewed, focusing on the three operational systems GRAPH, Graffiti and AutoGraphiX (AGX...
référence BibTeX
We consider the multiple depot vehicle scheduling problem (MDVSP) and propose a branch-and-bound algorithm for solving it that combines column generation, va...
référence BibTeX
Our research examines a permit trading system where all countries participate to achieve a long-term greenhouse gases (GHG) stabilization target. Our main ob...
référence BibTeX
We consider a game where players face environmental constraints. We derive and compare noncooperative, cooperative and umbrella scenarios. In the latter, the...
référence BibTeX
We describe an application of Variable Neighbourhood Search (VNS)methodology to continuous global optimization problems with box constraints. A general VNS a...
référence BibTeX
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...
référence BibTeX
Allocution donnée par le professeur Georges Zaccour à la Société Royale du Canada, le vendredi 23 avril 2004, à HEC Montréal.
référence BibTeX
In the present paper we review the method of augmenting graphs, which is a general approach to solve the maximum independent set problem. Our objective is th...
référence BibTeX