An \(n\)-tet graph approach for non-guillotine packings of \(n\)-dimensional boxes into an \(n\)-container
From MaRDI portal
Publication:1847196
DOI10.1016/S0377-2217(02)00135-2zbMath1081.90592OpenAlexW2042970314WikidataQ57719570 ScholiaQ57719570MaRDI QIDQ1847196
Publication date: 17 November 2002
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(02)00135-2
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Related Items
A global optimization approach for solving three-dimensional open dimension rectangular packing problems, An improved typology of cutting and packing problems, A beam search approach to the container loading problem, Unnamed Item, A new iterative-doubling greedy-lookahead algorithm for the single container loading problem, The multiple container loading cost minimization problem, A sequence representation for maps, Graph-encoded maps, Packing \(n\)-dimensional parallelepipeds with the feasibility of changing their orthogonal orientation in an \(n\)-dimensional parallelepiped, A two-stage tabu search algorithm with enhanced packing heuristics for the 3L-CVRP and M3L-CVRP, MIP-based approaches for the container loading problem with multi-drop constraints, Three-dimensional container loading models with cargo stability and load bearing constraints, A homological solution for the Gauss code problem in arbitrary surfaces, A comparative review of 3D container loading algorithms, A minimax theorem on circuits in projective graphs, Phorma: perfectly hashable order restricted multidimensional arrays, Some experiments with a simple tabu search algorithm for the manufacturer's pallet loading problem, An \(n\)-tet graph approach for non-guillotine packings of \(n\)-dimensional boxes into an \(n\)-container, Topological aspects of edge fusions in 4-graphs, Graph-encoded 3-manifolds, Optimization Models for the Three-Dimensional Container Loading Problem with Practical Constraints, Cubic combinatorial maps, Constraints in container loading -- a state-of-the-art review
Cites Work
- Unnamed Item
- Unnamed Item
- An algorithm for the three-dimensional packing problem with asymptotic performance analysis
- Cutting and packing. Special issue
- An AND/OR-graph approach to the solution of two-dimensional non-guillotine cutting problems
- How to use structural constraints to compute an upper bound for the pallet loading problem
- An analytical model for the container loading problem
- Packing problems
- A tabu search algorithm for weakly heterogeneous container loading problems
- 4-block heuristic for the rectangle packing problem
- An exact depth-first algorithm for the pallet loading problem
- Some experiments with simulated annealing techniques for packing problems
- An exact algorithm for the pallet loading problem
- A comparative evaluation of heuristics for container loading
- Load planning for shipments of low density products
- An \(n\)-tet graph approach for non-guillotine packings of \(n\)-dimensional boxes into an \(n\)-container
- A family of genetic algorithms for the pallet loading problem
- A simple and effective recursive procedure for the manufacturer's pallet loading problem
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography
- A Method for Solving Container Packing for a Single Size of Box
- A three-dimensional pallet loading method for single-size boxes
- A systematic approach for the three-dimensional palletization problem
- The G4-Heuristic for the Pallet Loading Problem
- An AND/OR-graph approach to the container loading problem
- Loading Multiple Pallets
- Recursive Computational Procedure for Two-dimensional Stock Cutting
