Two-dimensional packing problems: A survey

European Journal of Operational Research

Volumn 141, Issue 2, 2002, Pages 241-252

  Lodi, Andrea ^a   Martello, Silvano ^a   Monaci, Michele ^a  

^a UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

Bin packing problems; Strip packing problems; Two dimensional packing

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; HEURISTIC METHODS; LINEAR PROGRAMMING; MATHEMATICAL MODELS;

BIN PACKING PROBLEMS; STRIP PACKING PROBLEMS;

PROBLEM SOLVING;

EID: 0036722418     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(02)00123-6     Document Type: Article

References (54)

1. A 5/4 algorithm for two-dimensional packing
2. Orthogonal packing in two dimensions
3. An exact two-dimensional non-guillotine cutting tree search procedure
4. Two dimensional finite bin packing algorithms
5. An improved BL lower bound
6. The bottom-left bin packing heuristic: An efficient implementation
7. A analytical model for the container loading problem
8. On packing two-dimensional bins
9. Performance bounds for level-oriented two-dimensional packing algorithms
10. Average-case analysis of cutting and packing in two dimensions
11. On-line packing and covering problems
12. Optimal scheduling of tasks on identical parallel processors
13. Some experiments with simulated annealing techniques for packing problems
14. Packing problems
15. Cutting and packing (C&P)
16. New classes of lower bounds for bin packing problems
17. Bin packing can be solved within 1 + ε in linear time
18. Hybrid next-fit algorithm for the two-dimensional rectangle bin-packing problem
19. A linear programming approach to the cutting stock problem
20. A linear programming approach to the cutting stock problem - Part II
21. Multistage cutting problems of two and more dimensions
22. Performance bounds for orthogonal oriented two-dimensional packing algorithms
23. An exact algorithm for general, orthogonal, two-dimensional knapsack problems
24. An exact algorithm for the orthogonal, 2-D cutting problems using guillotine cuts
25. Bin-packing in 1.5 dimension
26. On genetic algorithms for the packing of polygons
27. An efficient approximation scheme for the one-dimensional bin-packing problem
28. A near-optimal solution to a two-dimensional cutting stock problem
29. Neighborhood search algorithm for the guillotine non-oriented two-dimensional bin packing problem
30. Approximation algorithms for the oriented two-dimensional bin packing problem
31. Heuristic and metaheuristic approaches for a class of two-dimensional bin packing problems
32. Recent advances on two-dimensional bin packing problems
33. Heuristic algorithms for the three-dimensional bin packing problem
34. Models and bounds for two-dimensional level packing problems
35. Bin packing with items uniformly distributed over intervals [a,b]
36. The three-dimensional bin packing problem
37. Exact solution of the two-dimensional finite bin packing problem
38. Equivalence and dominance for problems of optimal packing of rectangles
39. Reverse fit: A 2-optimal algorithm for packing rectangles
40. A 2.5 times optimal algorithm for packing in two dimensions
41. A strip-packing algorithm with absolute performance bound 2
42. Guided local search and its application to the traveling salesman problem