Combinatorial Algorithm for Optimizing Wood Waste in Framing Designs
暂无分享,去创建一个
[1] Xiang Song,et al. An iterative sequential heuristic procedure to a real-life 1.5-dimensional cutting stock problem , 2006, Eur. J. Oper. Res..
[2] J. V. D. Carvalho,et al. Cutting Stock Problems , 2005 .
[3] Cynthia Barnhart,et al. Using Branch-and-Price-and-Cut to Solve Origin-Destination Integer Multicommodity Flow Problems , 2000, Oper. Res..
[4] Harald Dyckhoff,et al. A New Linear Programming Approach to the Cutting Stock Problem , 1981, Oper. Res..
[5] Peter Trkman,et al. One-dimensional cutting stock optimization in consecutive time periods , 2007, Eur. J. Oper. Res..
[6] Robert W. Haessler. Technical Note - A Note on Computational Modifications to the Gilmore-Gomory Cutting Stock Algorithm , 1980, Oper. Res..
[7] François Vanderbeck,et al. Computational study of a column generation algorithm for bin packing and cutting stock problems , 1999, Math. Program..
[8] R. Moll,et al. An algorithm for the 2D guillotine cutting stock problem , 1993 .
[9] Martin W. P. Savelsbergh,et al. Branch-and-Price: Column Generation for Solving Huge Integer Programs , 1998, Oper. Res..
[10] John E. Beasley. A population heuristic for constrained two-dimensional non-guillotine cutting , 2004, Eur. J. Oper. Res..
[11] Michael A. Mullens,et al. Structural insulated panels: Impact on the residential construction process , 2006 .
[12] Zeger Degraeve,et al. Optimal Integer Solutions to Industrial Cutting Stock Problems , 1999, INFORMS J. Comput..
[13] R. Gomory,et al. A Linear Programming Approach to the Cutting-Stock Problem , 1961 .
[14] Guntram Scheithauer,et al. A branch&bound algorithm for solving one-dimensional cutting stock problems exactly , 1995 .
[15] J. M. Tracy. SIPs overcoming the elements. , 2000 .
[16] Jon Lee,et al. Rapid Prototyping of Optimization Algorithms Using COIN-OR: A Case Study Involving the Cutting-Stock Problem , 2005, Ann. Oper. Res..
[17] Pamela H. Vance,et al. Branch-and-Price Algorithms for the One-Dimensional Cutting Stock Problem , 1998, Comput. Optim. Appl..
[18] Gleb Belov,et al. Solving one-dimensional cutting stock problems exactly with a cutting plane algorithm , 2001, J. Oper. Res. Soc..
[19] Toàn Phan Huy,et al. A Branch-and-Bound Algorithm , 2000 .
[20] Olaf Diegel,et al. Enforcing minimum run length in the cutting stock problem , 2006, Eur. J. Oper. Res..