A Parallel Branch-and-Bound Approach to the Rectangular Guillotine Strip Cutting Problem
暂无分享,去创建一个
Graham Kendall | Edmund K. Burke | Jacek Blazewicz | Slawomir Bak | Grzegorz Pawlak | Maciej Plaza | G. Kendall | E. Burke | Sławomir Bąk | G. Pawlak | J. Błażewicz | M. Plaza
[1] B. Kröger. Guillotineable bin packing: A genetic approach , 1995 .
[2] Ansheng Deng,et al. A new heuristic recursive algorithm for the strip rectangular packing problem , 2006, Comput. Oper. Res..
[3] Loris Faina,et al. An application of simulated annealing to the cutting stock problem , 1999, Eur. J. Oper. Res..
[4] A. Bagchi,et al. Best-First Search Methods for Constrained Two-Dimensional Cutting Stock Problems , 1993, Oper. Res..
[5] E. Hopper,et al. A genetic algorithm for a 2D industrial packing problem , 1999 .
[6] Joseph Y.-T. Leung,et al. Packing Squares into a Square , 1990, J. Parallel Distributed Comput..
[7] Andreas Bortfeldt,et al. A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces , 2006, Eur. J. Oper. Res..
[8] Ramón Alvarez-Valdés,et al. Reactive GRASP for the strip-packing problem , 2008, Comput. Oper. Res..
[9] Hongfei Teng,et al. An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles , 1999, Eur. J. Oper. Res..
[10] E. Hopper,et al. A Review of the Application of Meta-Heuristic Algorithms to 2D Strip Packing Problems , 2001, Artificial Intelligence Review.
[11] Xian Cheng,et al. A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem , 2008, Comput. Oper. Res..
[12] Mhand Hifi. An improvement of viswanathan and bagchi's exact algorithm for constrained two-dimensional cutting stock , 1997, Comput. Oper. Res..
[13] Marvin D. Troutt,et al. Applications of genetic search and simulated annealing to the two-dimensional non-guillotine cutting stock problem , 2001 .
[14] Daniele Vigo,et al. An Exact Approach to the Strip-Packing Problem , 2003, INFORMS J. Comput..
[15] Wolfgang Maass,et al. Approximation schemes for covering and packing problems in image processing and VLSI , 1985, JACM.
[16] Julia A. Bennell,et al. The geometry of nesting problems: A tutorial , 2008, Eur. J. Oper. Res..
[17] Ronald L. Rivest,et al. Orthogonal Packings in Two Dimensions , 1980, SIAM J. Comput..
[18] Derek Smith,et al. Bin Packing with Adaptive Search , 1985, ICGA.
[19] P. Y. Wang,et al. Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems , 1983, Oper. Res..
[20] R. Gomory,et al. A Linear Programming Approach to the Cutting-Stock Problem , 1961 .
[21] Cheng-Yan Kao,et al. On solving rectangle bin packing problems using genetic algorithms , 1994, Proceedings of IEEE International Conference on Systems, Man and Cybernetics.
[22] L. Fogel,et al. European Journal Ofoperational Research on Genetic Algorithms for the Packing of Polygons , 1996 .
[23] Cihan H. Dagli,et al. New approaches to nesting rectangular patterns , 1997, J. Intell. Manuf..
[24] Ralph E. Gomory,et al. The Theory and Computation of Knapsack Functions , 1966, Oper. Res..
[25] Jacek Blazewicz,et al. Using a tabu search approach for solving the two-dimensional irregular cutting problem , 1993, Ann. Oper. Res..
[26] Harald Dyckhoff,et al. A typology of cutting and packing problems , 1990 .
[27] Mhand Hifi,et al. Exact algorithms for the guillotine strip cutting/packing problem , 1998, Comput. Oper. Res..
[28] Andrea Lodi,et al. Two-dimensional packing problems: A survey , 2002, Eur. J. Oper. Res..
[29] E. Hopper,et al. An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem , 2001, Eur. J. Oper. Res..
[30] Graham Kendall,et al. A Simulated Annealing Enhancement of the Best-Fit Heuristic for the Orthogonal Stock-Cutting Problem , 2009, INFORMS J. Comput..
[31] Gerhard Wäscher,et al. An improved typology of cutting and packing problems , 2007, Eur. J. Oper. Res..
[32] Graham Kendall,et al. A New Placement Heuristic for the Orthogonal Stock-Cutting Problem , 2004, Oper. Res..