Cahiers du GERAD
Recherche
Liste chronologique
3212 résultats — page 106 de 161
Cutting Stock Problems
Linear relaxations are solved by column generation. Stabilization techniques such as dual-optimal inequalities and stabilized column generation algorithms t...
référence BibTeX
We propose a Dynamic Programming (DP) approach combined with approximation for pricing options embedded in bonds, the focus being on call and put options wit...
référence BibTeX
Let <i>G</i>=(<i>V,E</i>) be a graph with vertex set <i>V</i> and edge set <i>E</i>. The <i>k</i>-colouring problem is to assign a colour (a number chosen ...
référence BibTeX
The shortest path problem with resource constraints consists of finding the minimum cost path between two specified points while respecting constraints on r...
référence BibTeXExact 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...
référence BibTeX
This paper deals with the control of the class of uncertain hybrid stochastic systems. The uncertainties we are considering are of norm bounded type. The st...
référence BibTeX
We study whether the introduction of a private label could be profitable for retailers and manufacturers. We also investigate if cooperative advertising cou...
référence BibTeX
In this work we propose to use a continuous Variable Neighborhood Search (VNS for short) heuristic for minimizing the potential energy function of molecules...
référence BibTeX
This paper presents some new heuristics based on variable neighborhood search to solve the vertex weighted <i>k</i>-cardinality tree problem. An efficient l...
référence BibTeX
We consider the bilevel uncapacitated facility location problem with user preferences. It is known that this model may be reformulated as a one-level locati...
référence BibTeX
This paper reports on the on-going development of a hybrid approach for dispatching and conflict-free routing of automated guided vehicles used for material...
référence BibTeX
We present a review of the various integer linear programming (ILP) formulations that have been proposed for the routing and wavelength assignment problem i...
référence BibTeX
The multiprocessor scheduling problem with communication delays that we consider in this paper consists of finding a static schedule of an arbitrary task gra...
référence BibTeX
In this note we explore the fact that a stationary point of some nonlinear non-convex optimization problem is not always a local optimum, and that such a st...
référence BibTeX
This paper deals with the topological design of a yotta-bit-per-second (1 <i>yotta</i> = 10<sup>24</sup>) multidimensional network. The YottaWeb is a recent...
référence BibTeXDesign of Balanced MBA Student Teams
In some schools and universities, students must sometimes be divided into several teams in such a way that each team provides a good representation of the cl...
référence BibTeXSelected Topics in Column Generation
Dantzig-Wolfe decomposition and column generation, devised for linear programs, is a success story in large scale integer programming. We outline and relate ...
référence BibTeX
We propose a differential game to study retailer’s allocation strategy of shelf-space shares between the manufacturers of two competing brands. Each manufact...
référence BibTeX
It is a common practice for a multi-branch firm to have its branches ordering a group of items from a single supplier. Obviously, co-ordinating the replenish...
référence BibTeX
This paper proposes a two-player, finite-horizon differential game model to analyze joint implementation in environmental projects, one of the flexible mecha...
référence BibTeX