PACKING A TRUCK — NOW WITH A TWIST!

DOI10.1142/S021819590700246XzbMath1142.65022MaRDI QIDQ3503017

Joachim Reichel, Andreas Karrenbauer, Friedrich Eisenbrand, Elmar Schömer, Stefan Funke

Publication date: 20 May 2008

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

zbMATH Keywords

combinatorial optimizationsimulated annealingcomputational geometrygeometric packing problemscar designorientations and placements of boxestrunk packing

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Combinatorial optimization (90C27) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)

Related Items

A fast heuristic for a three-dimensional non-convex domain loading problem

Cites Work

• Optimal packing and covering in the plane are NP-complete
• On packing squares with equal squares
• A typology of cutting and packing problems
• Approximation schemes for covering and packing problems in image processing and VLSI
• Polynomial-time approximation schemes for packing and piercing fat objects