Cutting Stock Problem Based on the Linear Programming Approach
暂无分享,去创建一个
[1] Daniele Vigo,et al. A lower bound for the non-oriented two-dimensional bin packing problem , 2002, Discret. Appl. Math..
[2] Erwin Kalvelagen. COLUMN GENERATION WITH GAMS , 2011 .
[3] Günther R. Raidl,et al. Solving a Real-World Glass Cutting Problem , 2004, EvoCOP.
[4] Alan Farley. The cutting stock problem in the canvas industry , 1990 .
[5] R. Dyson,et al. The Cutting Stock Problem in the Flat Glass Industry , 1974 .
[6] Manfred W. Padberg,et al. Packing small boxes into a big box , 2000, Math. Methods Oper. Res..
[7] Ralph E. Gomory,et al. The Theory and Computation of Knapsack Functions , 1966, Oper. Res..
[8] R. Gomory,et al. A Linear Programming Approach to the Cutting-Stock Problem , 1961 .
[9] R. Vahrenkamp,et al. Random search in the one-dimensional cutting stock problem , 1996 .
[10] R. Gomory,et al. Multistage Cutting Stock Problems of Two and More Dimensions , 1965 .
[11] Claudio Arbib,et al. An optimization model for trim loss minimization in an automotive glass plant , 2007, Eur. J. Oper. Res..
[12] Yaodong Cui,et al. Heuristic algorithm for a cutting stock problem in the steel bridge construction , 2009, Comput. Oper. Res..
[13] Nicos Christofides,et al. An exact algorithm for general, orthogonal, two-dimensional knapsack problems , 1995 .
[14] Sándor P. Fekete,et al. New classes of fast lower bounds for bin packing problems , 2001, Math. Program..
[15] Constantine Goulimis. Optimal solutions for the cutting stock problem , 1990 .
[16] Nicos Christofides,et al. An Algorithm for Two-Dimensional Cutting Problems , 1977, Oper. Res..
[17] Ralph E. Gomory,et al. A Linear Programming Approach to the Cutting Stock Problem---Part II , 1963 .
[18] Bernd Gärtner,et al. Understanding and using linear programming , 2007, Universitext.
[19] Reinaldo Morabito,et al. The cutting stock problem in a hardboard industry: a case study , 1998, Comput. Oper. Res..
[20] Bhaba R. Sarker,et al. An Optimum Solution for One-Dimensional Slitting Problems: A Dynamic Programming Approach , 1988 .
[21] Marco A. Boschetti,et al. The two-dimensional finite bin packing problem. Part I: New lower bounds for the oriented case , 2003, 4OR.
[22] Wayne L. Winston. Introduction to Mathematical Programming: Applications and Algorithms , 1990 .
[23] E. Hopper,et al. A genetic algorithm for a 2D industrial packing problem , 1999 .
[24] Susan G. Hahn. On the Optimal Cutting of Defective Sheets , 1968, Oper. Res..
[25] Chuen-Lung Chen,et al. A simulated annealing heuristic for the one-dimensional cutting stock problem , 1996 .
[26] Kurt Eisemann,et al. The Trim Problem , 1957 .
[27] J. Soeiro Ferreira,et al. A two-phase roll cutting problem , 1990 .
[28] Alberto Caprara,et al. On the two-dimensional Knapsack Problem , 2004, Oper. Res. Lett..
[29] Y Cui,et al. An algorithm for the two-dimensional cutting problem of punched strips with blade length constraint , 2008 .
[30] R. W. Haessler,et al. Cutting stock problems and solution procedures , 1991 .
[31] Reinaldo Morabito,et al. Optimizing the cutting of stock plates in a furniture company , 2000 .
[32] Yuval Lirov,et al. Knowledge based approach to the cutting stock problem , 1992 .
[33] C. Goldie,et al. Optimization Techniques , 1971, Nature.
[34] Reinaldo Morabito,et al. Optimising the cutting of wood fibre plates in the hardboard industry , 2007, Eur. J. Oper. Res..
[35] Marco A. Boschetti,et al. The Two-Dimensional Finite Bin Packing Problem. Part II: New lower and upper bounds , 2003, 4OR.
[36] Harald Dyckhoff,et al. A typology of cutting and packing problems , 1990 .
[37] John F. Pierce. Some large-scale production scheduling problems in the paper industry , 1964 .
[38] An LP-based approach to a two-stage cutting stock problem , 1995 .