Packing a trunk

DOI10.1007/B13632MaRDI QIDQ5897281zbMATH OpenOpenAlexFDO

Authors Friedrich Eisenbrand, Stefan Funke, Joachim Reichel, Elmar Schömer

Publication date 3 March 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b13632

Mathematics Subject Classification ID

Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Integer programming (90C10)

Recommendations

• PACKING A TRUCK — NOW WITH A TWIST!
• Packing small boxes into a big box.
• scientific article; zbMATH DE number 994195
• Packing cubes into a cube in \((D>3)\)-dimensions
• scientific article; zbMATH DE number 3945878

Cited in

(5)

• PACKING A TRUCK — NOW WITH A TWIST!
• A space-indexed formulation of packing boxes into a larger box
• Exploiting packing components in general-purpose integer programming solvers
• A fast heuristic for a three-dimensional non-convex domain loading problem
• Packing returning secretaries

This page was built for publication: Packing a trunk

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5897281)