Packing of convex polytopes into a parallelepiped

DOI10.1080/02331930500050681zbMath1134.90550OpenAlexW2047623432MaRDI QIDQ4675965

No author found.

Publication date: 6 May 2005

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331930500050681

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)

Related Items (9)

Extracting maximal objects from three-dimensional solid materials ⋮ Tools of mathematical modeling of arbitrary object packing problems ⋮ An overview on the use of operations research in additive manufacturing ⋮ Packing of concave polyhedra with continuous rotations using nonlinear optimisation ⋮ Covering a polygonal region by rectangles ⋮ Translational packing of arbitrary polytopes ⋮ Packing cylinders and rectangular parallelepipeds with distances between them into a given region ⋮ Heuristics for container loading of furniture ⋮ Mathematical Models of Placement Optimisation: Two- and Three-Dimensional Problems and Applications

Cites Work

• Optimization by Simulated Annealing
• Loading plates with non-identical items
• A simulated annealing-based algorithm using hierarchical models for general three-dimensional component layout.
• An efficient approach for the multi-pallet loading problem
• A computer-based heuristic for packing pooled shipment containers
• Heuristics for the container loading problem
• A Genetic Algorithm for Solving the Container Loading Problem
• Interactive ILP procedures for stacking optimization for the 3D palletization problem
• A systematic approach for the three-dimensional palletization problem
• Construction of a Φ-function for two convex polytopes

This page was built for publication: Packing of convex polytopes into a parallelepiped