The Number of Setups ( Different Patterns ) in One-Dimensional Stock Cutting
暂无分享,去创建一个
[1] R. Gomory,et al. A Linear Programming Approach to the Cutting-Stock Problem , 1961 .
[2] Robert W. Haessler,et al. Controlling Cutting Pattern Changes in One-Dimensional Trim Problems , 1975, Oper. Res..
[3] E. A. Mukhachiova,et al. Linear Programming Cutting Problems , 1993, Int. J. Softw. Eng. Knowl. Eng..
[4] Guntram Scheithauer,et al. The modified integer round-up property of the one-dimensional cutting stock problem , 1995 .
[5] J. Decarvalho. Exact solution of cutting stock problems using column generation and branch-and-Bound , 1998 .
[6] Christoph Nitsche,et al. Tighter relaxations for the cutting stock problem , 1999, Eur. J. 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] H. Foerster,et al. Pattern reduction in one-dimensional cutting stock problems , 2000 .
[9] Michael Jünger,et al. The ABACUS system for branch‐and‐cut‐and‐price algorithms in integer programming and combinatorial optimization , 2000, Softw. Pract. Exp..
[10] Gleb Belov,et al. Solving one-dimensional cutting stock problems exactly with a cutting plane algorithm , 2001, J. Oper. Res. Soc..
[11] G. S heithauerDresden,et al. A Cutting Plane Algorithm for the One-Dimensional Cutting Stock Problem with Multiple Stock Lengths , 2002 .
[12] Jürgen Rietz,et al. Tighter Bounds for the Gap and Non-IRUP Constructions in the One-dimensional Cutting Stock Problem , 2002 .
[13] Gleb Belov,et al. A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths , 2002, Eur. J. Oper. Res..
[14] Zeger Degraeve,et al. Optimal Integer Solutions to Industrial Cutting-Stock Problems: Part 2, Benchmark Results , 2003, INFORMS J. Comput..
[15] Toshihide Ibaraki,et al. One-dimensional cutting stock problem to minimize the number of different patterns , 2003, Eur. J. Oper. Res..