Unified Review of Column Generation Methods
VANDERBECK, François
Reformulations based algorithms for Combinatorial Optimization [Realopt]
Institut de Mathématiques de Bordeaux [IMB]
Reformulations based algorithms for Combinatorial Optimization [Realopt]
Institut de Mathématiques de Bordeaux [IMB]
VANDERBECK, François
Reformulations based algorithms for Combinatorial Optimization [Realopt]
Institut de Mathématiques de Bordeaux [IMB]
< Reduce
Reformulations based algorithms for Combinatorial Optimization [Realopt]
Institut de Mathématiques de Bordeaux [IMB]
Language
en
Communication dans un congrès
This item was published in
OPTIMIZATION 2014, 2014-07-28, Guimaraes.
English Abstract
Large scale Mixed Integer Programming (MIP) optimization models are intricate to solve. When the model decomposes into blocs, for instance when optimizing the use of multiple ressources, relaxing the linking constraints ...Read more >
Large scale Mixed Integer Programming (MIP) optimization models are intricate to solve. When the model decomposes into blocs, for instance when optimizing the use of multiple ressources, relaxing the linking constraints in a Lagrangian way can make the model tractable. Exploiting such decomposition to develop tight approximations has lead to tremendous progress in solving important applications. In this presentation, we review the alternative methods to solve the so-called Lagrangian dual model or its linear programming counterpart, the Dantzig-Wolfe master (associated with the column generation algorithm). We highlight their drawbacks, their common base, and their specific features, while discussing extentions of such methods.Read less <
Origin
Hal imported