Comparing Dantzig–Wolfe decompositions and branch-and-price algorithms for the multi-item capacitated lot sizing problem

References

• Alvelos , F. 2005 . “ Branch-and-price and multicommodity flows ” . Universidade do Minho . Ph.D. Thesis
   Google Scholar
• Aragão , M. and Uchoa , E. 2003 . Integer program reformulation for robust branch-and-cut-and-price algorithms . Working Paper
   Google Scholar
• Barnhart , C. , Johnson , E. , Nemhauser , G. , Savelsberg , M. and Vance , P. 1998 . Branch-and-price: column generation for solving huge integer programs . Oper. Res. , 46 ( 3 ) : 316 – 329 .
   Web of Science ®Google Scholar
• Belvaux , G. and Wolsey , L. A. 2000 . bc-prod: A specialized branch-and-cut system for lot-sizing problems . Manage. Sci. , 46 : 724 – 738 .
   Web of Science ®Google Scholar
• Bitran , G. and Yanasse , H. 1982 . Computational complexity of the capacitated lot size problem . Manage. Sci. , 28 ( 10 ) : 1174 – 1186 .
   Web of Science ®Google Scholar
• Chen , W. H. and Thizy , J. M. 1990 . Analysis of relaxations for the multi-item capacitated lot-sizing problem . Ann. Oper. Res. , 26 : 29 – 72 .
   Google Scholar
• Dantzig , G. B. and Wolfe , P. 1960 . Decomposition principle for linear programs . Oper. Res. , 8 : 101 – 111 .
   Web of Science ®Google Scholar
• Degraeve , Z. and Jans , R. 2007 . A new Dantzig--Wolfe reformulation and branch-and-price algorithm for the capacitated lot sizing problem with set up times . Oper. Res. , 55 : 909 – 920 .
   Web of Science ®Google Scholar
• Desaulniers , G. , Desrosiers , J. and Solomon , M. 2005 . Column Generation (GERAD 25th Anniversary Series) , New York : Springer .
   Google Scholar
• Diaby , M. , Bahl , H. , Karwan , M.H. and Zionts , S. 1992 . Capacitated lot-sizing and scheduling by Lagrangean relaxation . European J. Oper. Res. , 59 : 444 – 458 .
   Web of Science ®Google Scholar
• Diaby , M. , Bahl , H. , Karwan , M.H. and Zionts , S. 1992 . A Lagrangean relaxation approach for very-large scale capacitated lot-sizing . Manage. Sci. , 38 ( 9 ) : 1329 – 1340 .
   Web of Science ®Google Scholar
• Drexl , A. and Kimms , A. 1997 . Lot sizing and scheduling-survey and extensions . European J. Oper. Res. , 99 ( 2 ) : 221 – 235 .
   Web of Science ®Google Scholar
• Eppen , G. D. and Martin , R. K. 1987 . Solving multi-item capacitated lot-sizing problems using variable redefinition . Oper. Res. , 35 : 832 – 848 .
   Web of Science ®Google Scholar
• Ford , L. R. and Fulkerson , D. R. 1958 . A suggested computation for maximal multicommodity network flows . Manage. Sci. , 5 ( 1 ) : 97 – 101 .
   Web of Science ®Google Scholar
• Geoffrion , A. M. 1974 . Lagrangean relaxation for integer programming . Math. Program. Study , 2 : 82 – 114 .
   Google Scholar
• Gilmory , P. C. and Gomory , R. E. 1961 . Linear programming approach to the cutting stock problem: Part I . Oper. Res. , 9 : 849 – 859 .
   Google Scholar
• Gilmory , P. C. and Gomory , R. E. 1963 . Linear programming approach to the cutting stock problem: Part II . Oper. Res. , 11 : 863 – 888 .
   Google Scholar
• Guignard , M. and Kim , S. 1987 . Lagrangean decomposition: A model yielding stronger Lagrangean bounds . Math. Program. , 39 : 215 – 228 .
   Web of Science ®Google Scholar
• ILOG, CPLEX 8.1 User's Manual, 2002. Available at http://www.ilog.com
   Google Scholar
• Jans , R. and Degraeve , Z. 2004 . Improved lower bounds for the capacitated lot sizing problem with set up times . Oper. Res. Lett. , 32 : 185 – 195 .
   Web of Science ®Google Scholar
• Karimi , B. , Ghomi , S. and Wilson , J. 2003 . The capacitated lot sizing problem: A review of models and algorithms . Omega Int. J. Manage. Sci. , 31 : 365 – 378 .
   Web of Science ®Google Scholar
• Kuik , R. , Salomon , M. and Wassenhove , L. 1994 . Batching decisions: Structure and models . European J. Oper. Res. , 75 : 243 – 263 .
   Web of Science ®Google Scholar
• Lübbecke , M. E. and Desrosiers , J. 2005 . Selected topics in column generation . Oper. Res. , 53 ( 6 ) : 1007 – 1023 .
   Web of Science ®Google Scholar
• Manne , A. 1958 . Programming of economic lot sizes . Manage. Sci. , 4 ( 2 ) : 115 – 135 .
   Web of Science ®Google Scholar
• Park , S. , Kim , D. and Lee , K. An integer programming approach to the path selection problem . Proceedings of the 2003 International Network Optimization Conference . Evry/Paris.
   Google Scholar
• Perrot , N. and Vanderbeck , F. 2004 . “ Knapsack problems with setups ” . Tech. Rep. Université Bordeaux .
   Google Scholar
• Pochet , Y. and Wolsey , L. A. 1991 . Solving multi-item lot-sizing problems using strong cutting planes . Manage. Sci. , 37 : 53 – 67 .
   Web of Science ®Google Scholar
• Pochet , Y. and Wolsey , L. A. 2006 . Production Planning by Mixed Integer Programming , USA : Springer .
   Google Scholar
• Thizy , J. M. and Wassenhove , L. N.V. 1985 . Lagrangean relaxation for the multi-item capacitated lot sizing problem: A heuristic implementation . IIE Transac. , 17 : 308 – 313 .
   Web of Science ®Google Scholar
• Trigeiro , W. W. , Thomas , L. J. and McClain , J. O. 1989 . Capacitated lot sizing with setup times . Manage. Sci. , 35 : 353 – 366 .
   Web of Science ®Google Scholar
• Wagelmans , A. , Hoesel , S. V. and Kolen , A. 1992 . Economic lot sizing: An O(n log n) algorithm that runs in linear time in the Wagner--Whitin case . Oper. Res. , 40 ( 1 ) : S145 – S156 .
   Web of Science ®Google Scholar
• Wagner , H. and Whitin , T. 1958 . Dynamic version of the economic lot size model . Manage. Sci. , 5 ( 1 ) : 89 – 96 .
   Web of Science ®Google Scholar
• Wilhelm , W. E. 2001 . A technical review of column generation in integer programming . Optim. Eng. , 2 ( 2 ) : 159 – 200 .
   Google Scholar