Data Structures for Higher-Dimensional Rectilinear Packing

DOI10.1287/ijoc.1110.0464zbMath1462.90100OpenAlexW2008741874MaRDI QIDQ2815459

Sam D. Allen, Edmund Kieran Burke

Publication date: 29 June 2016

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.1110.0464

zbMATH Keywords

combinatorial optimizationcutting stockdata structurecomputers

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Unnamed Item
• A hybrid placement strategy for the three-dimensional strip packing problem
• An efficient placement heuristic for three-dimensional rectangular packing
• Heuristic approaches for the two- and three-dimensional knapsack packing problem
• Packing small boxes into a big box.
• A MIP approach for some practical packing problems: balancing constraints and tetris-like items
• Three-dimensional packing of items with limited load bearing strength
• An improved typology of cutting and packing problems
• A heuristic for the three-dimensional strip packing problem
• Extreme Point-Based Heuristics for Three-Dimensional Bin Packing
• A Simulated Annealing Enhancement of the Best-Fit Heuristic for the Orthogonal Stock-Cutting Problem
• The Three-Dimensional Bin Packing Problem
• A New Placement Heuristic for the Orthogonal Stock-Cutting Problem

This page was built for publication: Data Structures for Higher-Dimensional Rectilinear Packing