PackLib2: An integrated library of multi-dimensional packing problems

European Journal of Operational Research

Volumn 183, Issue 3, 2007, Pages 1131-1135

  Fekete, Sándor P ^a   van der Veen, Jan C ^a  

^a TECHNICAL UNIVERSITY OF BRAUNSCHWEIG   (Germany)

Author keywords

Benchmark library; Multi dimensional packing; Open problems; Packing and cutting; XML

Indexed keywords

ALGORITHMS; BENCHMARKING; BIBLIOGRAPHIC RETRIEVAL SYSTEMS; OPERATIONS RESEARCH; PROBLEM SOLVING; XML;

BENCHMARK LIBRARY; MULTI-DIMENSIONAL PACKING; OPEN PROBLEMS; PACKING AND CUTTING;

DATA STRUCTURES;

EID: 34447103875     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2006.04.023     Document Type: Article

References (32)

1. D. Applegate, R. Bixby, V. Chvátal, W. Cook, On the solution of traveling salesman problems, Documenta Mathematica, in: Extra Volume Proceedings ICM III (1998), 1998, pp. 645-656 .
2. Beasley J.E. Algorithms for unconstrained two-dimensional guillotine cutting. Journal of the Operational Research Society 36 (1985) 297-306
3. Beasley J.E. An exact two-dimensional non-guillotine cutting tree search procedure. Operations Research 33 (1985) 49-64
4. Beasley J.E. OR-Library: Distributing test problems by electronic mail. Journal of the Operational Research Society 41 11 (1990) 1069-1072
5. Bengtsson B.E. Packing rectangular pieces-a heuristic approach. The Computer Journal 25 (1982) 353-357
6. In: Bischoff E., and Wäscher G. (Eds). Special Issue on Cutting and Packing. European Journal of Operational Research vol. 84 (1995), Elsevier B.V., Amsterdam
7. Bixby R.E., Boyd E.A., Dadmehr S.S., and Indovina R. The MIPLIB mixed integer programming library. COAL Bulletin 22 (1993)
8. Caprara A., and Monaci M. On the two-dimensional knapsack problem. Operations Research Letters 32 1 (2004) 5-14
9. Christofides N., and Whitlock C. An algorithm for two-dimensional cutting problems. Operations Research 25 1 (1977) 30-44
10. Cook W.J., and Rohe A. Computing minimum-weight perfect matchings. INFORMS Journal on Computing 11 (1999) 138-148
11. Cung V.-D., Hifi M., and Le Cun B. Constrained two-dimensional cutting stock problems-a best-first branch-and-bound algorithm. International Transactions in Operational Research 7 (2000) 185-210
12. In: Dyckhoff H., and Wäscher G. (Eds). Special Issue on Cutting and Packing. European Journal of Operational Research vol. 44 (1990), Elsevier B.V., Amsterdam
13. ESICUP, EURO Special Interest Group in Cutting and Packing. Available from: .
14. Fekete S.P., Köhler E., and Teich J. Multi-dimensional packing with order constraints. Proceedings of the Seventh International Workshop on Algorithms and Data Structures. Lecture Notes in Computer Science vol. 2125 (2001), Springer, Berlin 300-312
15. Fekete S.P., Meijer H., Rohe A., and Tietze W. Good and fast heuristics for large geometric maximum matching and maximum traveling salesman problems. Journal of Experimental Algorithms 7 (2002) 20 p
16. S.P. Fekete, J. Schepers, J.C. Van der Veen, An exact algorithm for higher-dimensional packing, Operations Research, in press.
17. Fekete S.P., and Schepers J. A new exact algorithm for general orthogonal d-dimensional knapsack problems. Algorithms-ESA '97. Lecture Notes Computer Science vol. 1284 (1997), Springer, Berlin 144-156
18. Fekete S.P., and Schepers J. A combinatorial characterization of higher dimensional orthogonal packing. Mathematics of Operations Research 29 (2004) 353-368
19. Herz J.C. Recursive computational procedure for two-dimensional stock cutting. IBM Journal of Research and Development 16 (1972) 462-469
20. Hifi M. An improvement of Viswanathan and Bagchi's exact algorithm for constrained two-dimensional cutting stock. Computers and Operations Research 24 8 (1997) 727-736
21. Hopper E., and Turton B.C.H. An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem. European Journal of Operational Research 128 1 (2001) 34-57
22. E. Pegg Jr., The Eternity puzzle. Available from: .
23. T. Koch, A. Martin, S. Voß, SteinLib: An updated library on Steiner tree problems in graphs, Technical Report ZIB-Report 00-37, Konrad-Zuse-Zentrum für Informationstechnik Berlin, Takustr. 7, Berlin, 2000.
24. Martello S., Pisinger D., and Vigo D. The three-dimensional bin packing problem. Operations Research 48 (2000) 256-267
25. Martello S., and Vigo D. Exact solution of the two-dimensional finite bin packing problem. Management Science 44 3 (1998) 388-399
26. Reinelt G. TSPLIB-a traveling salesman problem library. ORSA Journal of Computing 3 4 (1991) 376-384
27. Teich J., Fekete S.P., and Schepers J. Optimal hardware reconfiguration techniques. Journal of Supercomputing 19 (2001) 57-75
28. Tschöke S., and Holthöfer N. A new parallel approach to the constrained two-dimensional cutting stock problem. Proceedings of the Second Workshop Parallel Algorithms for Irregularly Structured Problems. Lecture Notes in Computer Science vol. 980 (1995), Springer, Berlin 285-300
29. Wang P.Y. Two algorithms for constrained two-dimensional cutting stock problems. Operations Research 31 (1983) 573-586
30. In: Wang P.Y., and Wäscher G. (Eds). Special Issue on Cutting and Packing. European Journal of Operational Research vol. 141 (2002), Elsevier B.V., Amsterdam
31. G. Wäscher, H. Haußner, H. Schumann, An improved typology of cutting and packing problems, European Journal of Operational Research, this issue, doi:10.1016/j.ejor.2005.12.047.
32. M. Wottawa, PACKLIB: Ein ASCII-Datenformat für Packungsprobleme, Technical Report 216, Mathematisches Institut, Universität zu Köln, 1996.