A generic view of Dantzig-Wolfe decomposition in mixed integer programming

Operations Research Letters

Volumn 34, Issue 3, 2006, Pages 296-306

  Vanderbeck, François ^a   Savelsbergh, Martin W P ^b  

^a UNIVERSITÉ DE BORDEAUX   (France)

^b GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Column generation; Dantzig Wolfe decomposition; Integer programming; Lagrangian relaxation; Stabilization techniques

Indexed keywords

LAGRANGE MULTIPLIERS; PROBLEM SOLVING; SET THEORY;

COLUMN GENERATION; DANTZIG-WOLFE DECOMPOSITION; LAGRANGIAN RELAXATION; STABILIZATION TECHNIQUES;

INTEGER PROGRAMMING;

EID: 32644453668     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.orl.2005.05.009     Document Type: Article

References (20)

1. C. Barnhart, E.L. Johnson, G.L. Nemhauser, M.W.P. Savelsbergh, and P.H. Vance Branch-and-price: column generation for huge integer programs Oper. Res. 46 1998 316 329
2. O. Briant, C. Lemaréchal, Ph. Meurdesoif, S. Michel, N. Perrot, F. Vanderbeck, Comparison of bundle and classical column generation, INRIA Working paper 5453, January 2005.
3. Z. Degraeve, R. Jans, A New Dantzig-Wolfe Reformulation and Branch-and-Price Algorithm for the Capacitated Lot Sizing Problem with Set Up Times, ERIM Report Series Research in Management, ERS-2003-010-LIS, 2003.
4. G. Desaulniers, J. Desrosiers, M.M. Solomon (Eds.), Column Generation, Springer, Berlin, 2005.
5. S.P. Fekete, and J. Schepers New classes of lower bounds for bin packing problems Math. Programming 91 2001 11 31
6. A. Geoffrion Lagrangian relaxation for integer programming Math. Programming Study 2 1974 82 114
7. C. Lemaréchal Lagrangian relaxation M. Jünger D. Naddef Computational Combinatorial Optimization 1998 Springer Berlin
8. M.E. Lübbecke, J. Desrosiers, Selected topics in column generation, Oper. Res. 2005.
9. R.K. Martin Generating alternative mixed-integer programming models using variable redefinition Oper. Res. 35 6 1987 820 831
10. K. Monneris, Problème de production par lots avec temps de mise en route par une méthode de branch-and-price, Rapport de stage de DEA, Université Bordeaux 1, juin 2002.
11. N. Perrot, Integer programming column generation strategies for the cutting stock problem and its variants, Ph.D. Thesis, University Bordeaux 1 (2005).
12. M.W.P. Savelsbergh Preprocessing and probing techniques for mixed integer programming problems ORSA J. Computing 6 1994 445 454
13. M.W.P. Savelsbergh, and M. Sol The general pickup and delivery problem Transportation Sci. 29 1 1995 17 29
14. J.-M. Thizy Analysis of Lagrangian decomposition for the multi-item capacitated lot-sizing problem INFOR 29 4 1991 271 283
15. J.M. Valério de Carvalho Using extra dual cuts to accelerate column generation INFORMS J. Computing 17 2 2005
16. J.M. van den Akker, C.A.J. Hurkens, and M.W.P. Savelsbergh Time-indexed formulations for machine scheduling problems: column generation INFORMS J. Computing 12 1998 111 124
17. F. Vanderbeck Computational study of a column generation algorithm for bin packing and cutting stock problems Math. Programming 86 1999 565 594
18. F. Vanderbeck On Dantzig-Wolfe decomposition in integer programming and ways to perform branching in a branch-and-price algorithm Oper. Res. 48 1 2000 111 128
19. F. Vanderbeck, Implementing mixed integer column generation, in: G. Desaulniers, J. Desrosiers, M.M. Solomon (Eds.), Column Generation, Springer, Berlin, 2005.
20. M. van Vyve, A solution approach of production planning problems based on compact formulations of lot-sizing models, Ph.D. Thesis, Université Catholique de Louvain, juin 2003.