Neighborhood Search Algorithm for the Guillotine Non-Oriented Two-Dimensional Bin Packing Problem
暂无分享,去创建一个
[1] S. Martello,et al. Exact Solution of the Two-Dimensional Finite Bon Packing Problem , 1998 .
[2] Bengt-Erik Bengtsson,et al. Packing Rectangular Pieces - A Heuristic Approach , 1982, Comput. J..
[3] Attahiru Sule Alfa,et al. A Search-Based Heuristic For The Two-Dimensional Bin-Packing Problem , 1994 .
[4] John E. Beasley,et al. Algorithms for Unconstrained Two-Dimensional Guillotine Cutting , 1985 .
[5] Edward G. Coffman,et al. Average-case analysis of cutting and packing in two dimensions , 1990 .
[6] J. O. Berkey,et al. Two-Dimensional Finite Bin-Packing Algorithms , 1987 .
[7] Nicos Christofides,et al. An Algorithm for Two-Dimensional Cutting Problems , 1977, Oper. Res..
[8] Ronald L. Rivest,et al. Orthogonal Packings in Two Dimensions , 1980, SIAM J. Comput..
[9] Igal Golan,et al. Performance Bounds for Orthogonal Oriented Two-Dimensional Packing Algorithms , 1981, SIAM J. Comput..
[10] Mauro Dell'Amico,et al. Annotated Bibliographies in Combinatorial Optimization , 1997 .
[11] John H. Vande Vate,et al. Expected performance of the shelf heuristic for 2-dimensional packing , 1989 .
[12] Robert E. Tarjan,et al. Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms , 1980, SIAM J. Comput..
[13] D. S. Johnson,et al. On Packing Two-Dimensional Bins , 1982 .
[14] Daniele Vigo,et al. Approximation algorithms for the oriented two-dimensional bin packing problem , 1999, Eur. J. Oper. Res..
[15] John E. Beasley,et al. An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure , 1985, Oper. Res..