Comparing Dantzig–Wolfe decompositions and branch-and-price algorithms for the multi-item capacitated lot sizing problem
暂无分享,去创建一个
José M. Valério de Carvalho | Carina Maria Oliveira Pimentel | Filipe Pereira Alvelos | C. Pimentel | F. Alvelos | J. M. V. Carvalho
[1] Laurence A. Wolsey,et al. bc -- prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems , 2000 .
[2] R. Gomory,et al. A Linear Programming Approach to the Cutting-Stock Problem , 1961 .
[3] George B. Dantzig,et al. Decomposition Principle for Linear Programs , 1960 .
[4] Zeger Degraeve,et al. BIBLIOGRAPHIC DATA AND CLASSIFICATIONS , 2003 .
[5] Jeanine Weekes Schroer,et al. The Finite String Newsletter Abstracts of Current Literature Glisp User's Manual , 2022 .
[6] W. Wilhelm. A Technical Review of Column Generation in Integer Programming , 2001 .
[7] Filipe Pereira e Alvelos,et al. Branch-and-price and multicommodity flows , 2005 .
[8] Lester Randolph Ford,et al. A Suggested Computation for Maximal Multi-Commodity Network Flows , 2004, Manag. Sci..
[9] Harish C. Bahl,et al. Capacitated lot-sizing and scheduling by Lagrangean relaxation , 1992 .
[10] G. D. Eppen,et al. Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition , 1987, Oper. Res..
[11] Albert P. M. Wagelmans,et al. Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case , 1992, Oper. Res..
[12] Nancy Perrot,et al. Knapsack problems with setups , 2009, Eur. J. Oper. Res..
[13] L Van Wassenhove,et al. Lagrangean Relaxation for the Multi-Item Capacitated Lot-Sizing Problem , 1985 .
[14] Alan S. Manne,et al. Programming of Economic Lot Sizes , 1958 .
[15] Marc Salomon,et al. Batching decisions: structure and models , 1994 .
[16] William W. Trigeiro,et al. Capacitated lot sizing with setup times , 1989 .
[17] Alf Kimms,et al. Lot sizing and scheduling -- Survey and extensions , 1997 .
[18] Harvey M. Wagner,et al. Dynamic Version of the Economic Lot Size Model , 2004, Manag. Sci..
[19] Jacques Desrosiers,et al. Selected Topics in Column Generation , 2002, Oper. Res..
[20] Martin W. P. Savelsbergh,et al. Branch-and-Price: Column Generation for Solving Huge Integer Programs , 1998, Oper. Res..
[21] John M. Wilson,et al. The capacitated lot sizing problem: a review of models and algorithms , 2003 .
[22] Z. Degraeve,et al. Improved Lower Bounds for the Capacitated Lot Sizing Problem with Set Up Times , 2003 .
[23] Harish C. Bahl,et al. A Lagrangean Relaxation Approach for Very-Large-Scale Capacitated Lot-Sizing , 1992 .
[24] Laurence A. Wolsey,et al. Production Planning by Mixed Integer Programming , 2010 .
[25] Laurence A. Wolsey,et al. Multi-item lot-sizing problems using strong cutting planes , 1991 .
[26] Monique Guignard-Spielberg,et al. Lagrangean decomposition: A model yielding stronger lagrangean bounds , 1987, Math. Program..
[27] G. Bitran,et al. Computational Complexity of the Capacitated Lot Size Problem , 1982 .
[28] Zeger Degraeve,et al. Improved lower bounds for the capacitated lot sizing problem with setup times , 2004, Oper. Res. Lett..
[29] M. P. Aragão,et al. Integer Program Reformulation for Robust Branch-and-Cut-and-Price Algorithms , 2003 .
[30] Arthur M. Geoffrion,et al. Lagrangian Relaxation for Integer Programming , 2010, 50 Years of Integer Programming.
[31] Ralph E. Gomory,et al. A Linear Programming Approach to the Cutting Stock Problem---Part II , 1963 .
[32] Wun-Hwa Chen,et al. Analysis of relaxations for the multi-item capacitated lot-sizing problem , 1991 .