Exact solution of the two-dimensional finite bin packing problem

Management Science

Volumn 44, Issue 3, 1998, Pages 388-399

  Martello, Silvano ^a   Vigo, Daniele ^a  

^a UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

Branch and bound; Cutting and Packing; Worst case Analysis

Indexed keywords

ALGORITHMS; OPTIMIZATION; PACKAGING; SET THEORY;

BRANCH AND BOUND; TWO DIMENSIONAL FINITE BIN PACKING PROBLEM; WORST CASE ANALYSIS;

OPERATIONS RESEARCH;

EID: 0032023068     PISSN: 00251909     EISSN: None     Source Type: Journal    
DOI: 10.1287/mnsc.44.3.388     Document Type: Article

References (19)

1. Baker, B. S., E. G. Coffman, Jr., and R. L. Rivest, "Orthogonal Packing in Two Dimensions," SIAM J. Computing, 9, 4 (1980), 846-855.
2. Bartholdi, J. J. III, J. H. Vande Vate, and J. Zhang, "Expected Performance of the Shelf Heuristic for the 2-dimensional Packing," Operations Res. Letters, 8 (1989), 11-16.
3. Beasley, J. E., "Algorithms for Unconstrained Two-dimensional Guillotine Cutting," J. Operational Res. Society, 36 (1985a), 297-306.
4. _, "An Exact Two-dimensional Non-guillotine Cutting Tree Search Procedure," Operations Res., 33 (1985b), 49-64.
5. _, "Or-library: Distributing Test Problems by Electronic Mail," J. Operational Res. Society, 41 (1990), 1069-1072.
6. Bengtsson, B. E., "Packing Rectangular Pieces - A Heuristic Approach," The Computer J., 25 (1982), 353-357.
7. Berkey, J. O. and P. Y. Wang, "Two Dimensional Finite Bin Packing Algorithms," J. of Operational Res. Society, 38 (1987), 423-429.
8. Christofides, N. and C. Whitlock, "An Algorithm for Two-dimensional Cutting Problems," Operations Res., 25 (1977), 30-44.
9. Coffman, E. G., Jr., M. R. Garey, D. S. Johnson, and R. E. Tarjan, "Performance Bounds for Level-oriented Two-dimensional Packing Algorithms," SIAM J. Computing, 9, 4 (1980), 801-826.
10. _ and P. W. Shor, "Average-case Analysis of Cutting and Packing in Two Dimensions," European J. Operational Res., 44 (1990), 134-144.
11. Dell'Amico, M. and S. Martello, "Optimal Scheduling of Tasks on Identical Parallel Processors," ORSA J. Computing, 7, 2 (1995), 191-200.
12. Dowsland, K. A. and W. B. Dowsland, "Packing Problems," European J. Operational Res., 56 (1992), 2-14.
13. Dyckhoff, H. and U. Finke, Cutting and Packing in Production and Distribution, Physica Verlag, Heidelberg, 1992.
14. _, G. Scheithauer, and J. Terno, "Cutting and Packing (C&P)," in M. Dell'Amico, F. Maffioli, and S. Martello (Eds.), Annotated Bibliographies in Combinatorial Optimization, John Wiley & Sons, Chichester, 1997.
15. El-Bouri, A., N. Popplewell, S. Balakrishnan, and A. Alfa, "A Search Based Heuristic for the Two-dimensional Bin-packing Problem," INFOR, 32, 4 (1994), 265-274.
16. Frenk, J. B. and G. G. Galambos, "Hybrid Next-fit Algorithm for the Two-dimensional Rectangle Bin-packing Problem," Computing, 39 (1987), 201-217.
17. Hadjiconstantinou, E. and N. Christofides, "An Exact Algorithm for General, Orthogonal, Two-dimensional Knapsack Problems," European J. Operational Res., 83 (1995), 39-56.
18. Martello, S. and P. Toth, Knapsack Problems: Algorithms and Computer Implementations, John Wiley & Sons, Chichester, 1990a.
19. _ and _, "Lower Bounds and Reduction Procedures for the Bin Packing Problem," Discrete Applied Math., 28 (1990b), 59-70.