Setup and Open-Stacks Minimization in One-Dimensional Stock Cutting
暂无分享,去创建一个
[1] Boon J. Yuen. Heuristics for sequencing cutting patterns , 1991 .
[2] G. S heithauerDresden,et al. A Cutting Plane Algorithm for the One-Dimensional Cutting Stock Problem with Multiple Stock Lengths , 2002 .
[3] J. Decarvalho. Exact solution of cutting stock problems using column generation and branch-and-Bound , 1998 .
[4] José M. Valério de Carvalho,et al. Exact solution of bin-packing problems using column generation and branch-and-bound , 1999, Ann. Oper. Res..
[5] Jürgen Rietz,et al. Tighter Bounds for the Gap and Non-IRUP Constructions in the One-dimensional Cutting Stock Problem , 2002 .
[6] José M. Valério de Carvalho,et al. LP models for bin packing and cutting stock problems , 2002, Eur. J. Oper. Res..
[7] Harald Dyckhoff,et al. Cutting and Packing in Production and Distribution , 1992 .
[8] Zeger Degraeve,et al. Optimal Integer Solutions to Industrial Cutting-Stock Problems: Part 2, Benchmark Results , 2003, INFORMS J. Comput..
[9] R. Gomory,et al. A Linear Programming Approach to the Cutting-Stock Problem , 1961 .
[10] Robert W. Haessler,et al. Controlling Cutting Pattern Changes in One-Dimensional Trim Problems , 1975, Oper. Res..
[11] G. Scheithauer,et al. The Number of Setups ( Different Patterns ) in One-Dimensional Stock Cutting , 2003 .
[12] Guntram Scheithauer,et al. The modified integer round-up property of the one-dimensional cutting stock problem , 1995 .
[13] R. Vahrenkamp,et al. Random search in the one-dimensional cutting stock problem , 1996 .
[14] Gleb Belov,et al. A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting , 2006, Eur. J. Oper. Res..
[15] E. A. Mukhachiova,et al. Linear Programming Cutting Problems , 1993, Int. J. Softw. Eng. Knowl. Eng..
[16] Robert E. Johnston,et al. A new model for complete solutions to one-dimensional cutting stock problems , 2004, Eur. J. Oper. Res..
[17] Emanuel Falkenauer,et al. A hybrid grouping genetic algorithm for bin packing , 1996, J. Heuristics.
[18] Christoph Nitsche,et al. Tighter relaxations for the cutting stock problem , 1999, Eur. J. Oper. Res..