An n-tet graph approach for non-guillotine packings of n-dimensional boxes into an n-container

European Journal of Operational Research

Volumn 141, Issue 2, 2002, Pages 421-439

  Lins, Lauro ^a   Lins, Sóstenes ^a   Morabito, Reinaldo ^b  

^a FEDERAL UNIVERSITY OF PERNAMBUCO   (Brazil)

^b FEDERAL UNIVERSITY OF SÃO CARLOS   (Brazil)

Author keywords

3 Dimensional packing; Combinatorial optimization; Graph theory; Pallet container loading

Indexed keywords

ALGORITHMS; CONTAINERS; GRAPH THEORY; LOADING; OPTIMIZATION; PACKING; PROBLEM SOLVING;

COMBINATORIAL OPTIMIZATION;

OPERATIONS RESEARCH;

EID: 0036722395     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(02)00135-2     Document Type: Article

References (37)

1. A systematic approach for the three-dimensional palletization problem
2. An AND/OR-graph approach to the solution of two-dimensional non-guillotine cutting problems
3. Special issue: Cutting and packing problems
4. The pallet loading problem: A survey
5. An exact two-dimensional non-guillotine tree search procedure
6. A comparative evaluation of heuristics for container loading
7. Loading multiple pallets
8. Special issue on cutting and packing
9. An exact depth-first algorithm for the pallet loading problem
10. A tabu search algorithm for weakly heterogeneous container loading problems
11. An analytical model for the container loading problem
12. A recursive computational procedure for container loading
13. An exact algorithm for the pallet loading problem
14. Some experiments with simulated annealing techniques for packing problems
15. Packing problems
16. Improving palletization efficiency - The theoretical basis and practical applications
17. Cutting and packing
18. A method for solving container packing for a single size of box
19. Load planning for shipments of low density products
20. A family of genetic algorithms for the pallet loading problem
21. Recursive computational procedure for two dimensional stock cutting
22. A 9-fold partition heuristic for packing boxes into a container
23. A three-dimensional pallet loading method for single-size boxes
24. Special issue: Knapsack, packing and cutting, Part I: One dimensional knapsack problems
25. Special issue: Knapsack, packing and cutting, Part II: Multidimensional knapsack and cutting stock problems
26. An algorithm for the three-dimensional packing problem with asymptotic performance analysis
27. An AND/OR-graph approach to the container loading problem
28. A simple and effective recursive procedure for the manufacturer's pallet loading problem
29. Loading optimization of palletized products on trucks
30. How to use structural constraints to compute an upper bound for the pallet loading problem
31. 4-block heuristic for the rectangle packing problem
32. The G4-heuristic for the pallet loading problem
33. Cutting and packing problems: A categorized, application-oriented research bibliography
34. Three dimensional palletization of mixed box sizes