Integer linear programming models for 2-staged two-dimensional Knapsack problems
暂无分享,去创建一个
[1] R. Gomory,et al. Multistage Cutting Stock Problems of Two and More Dimensions , 1965 .
[2] M. Hifi,et al. A recursive exact algorithm for weighted two-dimensional cutting , 1996 .
[3] S. Martello,et al. Exact Solution of the Two-Dimensional Finite Bon Packing Problem , 1998 .
[4] Michele Monaci,et al. Algorithms for packing and scheduling problems , 2003, 4OR.
[5] Gerhard Wäscher,et al. Cutting and packing , 1995, Eur. J. Oper. Res..
[6] François Vanderbeck,et al. Computational study of a column generation algorithm for bin packing and cutting stock problems , 1999, Math. Program..
[7] Andrea Lodi,et al. Two-dimensional packing problems: A survey , 2002, Eur. J. Oper. Res..
[8] François Vanderbeck,et al. A Nested Decomposition Approach to a Three-Stage, Two-Dimensional Cutting-Stock Problem , 2001, Manag. Sci..
[9] Mhand Hifi,et al. Approximate and Exact Algorithms for Constrained (Un) Weighted Two-dimensional Two-staged Cutting Stock Problems , 2001, J. Comb. Optim..
[10] Reinaldo Morabito,et al. The cutting stock problem in a hardboard industry: a case study , 1998, Comput. Oper. Res..
[11] Mhand Hifi,et al. Exact Algorithms for Large-Scale Unconstrained Two and Three Staged Cutting Problems , 2001, Comput. Optim. Appl..
[12] George S. Lueker,et al. Bin packing with items uniformly distributed over intervals [a,b] , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[13] Nicos Christofides,et al. An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts , 1995 .
[14] Daniele Vigo,et al. Models and Bounds for Two-Dimensional Level Packing Problems , 2004, J. Comb. Optim..
[15] R. Gomory,et al. A Linear Programming Approach to the Cutting-Stock Problem , 1961 .