Exact Solution of the Two-Dimensional Finite Bon Packing Problem
暂无分享,去创建一个
[1] Nicos Christofides,et al. An Algorithm for Two-Dimensional Cutting Problems , 1977, Oper. Res..
[2] Robert E. Tarjan,et al. Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms , 1980, SIAM J. Comput..
[3] Ronald L. Rivest,et al. Orthogonal Packings in Two Dimensions , 1980, SIAM J. Comput..
[4] Bengt-Erik Bengtsson,et al. Packing Rectangular Pieces - A Heuristic Approach , 1982, Comput. J..
[5] John E. Beasley,et al. An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure , 1985, Oper. Res..
[6] John E. Beasley,et al. Algorithms for Unconstrained Two-Dimensional Guillotine Cutting , 1985 .
[7] J. O. Berkey,et al. Two-Dimensional Finite Bin-Packing Algorithms , 1987 .
[8] John H. Vande Vate,et al. Expected performance of the shelf heuristic for 2-dimensional packing , 1989 .
[9] Paolo Toth,et al. Lower bounds and reduction procedures for the bin packing problem , 1990, Discret. Appl. Math..
[10] Paolo Toth,et al. Knapsack Problems: Algorithms and Computer Implementations , 1990 .
[11] Edward G. Coffman,et al. Average-case analysis of cutting and packing in two dimensions , 1990 .
[12] John E. Beasley,et al. OR-Library: Distributing Test Problems by Electronic Mail , 1990 .
[13] Harald Dyckhoff,et al. Cutting and Packing in Production and Distribution , 1992 .
[14] Attahiru Sule Alfa,et al. A Search-Based Heuristic For The Two-Dimensional Bin-Packing Problem , 1994 .
[15] Nicos Christofides,et al. An exact algorithm for general, orthogonal, two-dimensional knapsack problems , 1995 .
[16] Mauro Dell'Amico,et al. Optimal Scheduling of Tasks on Identical Parallel Processors , 1995, INFORMS J. Comput..
[17] Gerhard Wäscher,et al. Cutting and packing , 1995, Eur. J. Oper. Res..