On variable-sized multidimensional packing

DOI10.1007/978-3-540-30140-0_27MaRDI QIDQ5464587zbMATH OpenOpenAlexFDO

Authors Leah Epstein, Rob van Stee

Publication date 18 August 2005

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

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

Mathematics Subject Classification ID

Analysis of algorithms (68W40)

Recommendations

• Optimal Online Algorithms for Multidimensional Packing Problems
• Optimal online bounded space multidimensional packing
• New bounds for multidimensional packing
• Scientific article; zbMATH DE number 2119702
• Online algorithms for 1-space bounded multidimensional bin packing and hypercube packing

Cited in

(11)

• New bounds for multidimensional packing
• Lower bounds for three-dimensional multiple-bin-size bin packing problems
• Packing items to feed assembly lines
• Online square and cube packing
• A GRASP/path relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems
• Competitive multi-dimensional dynamic bin packing via L-shape bin packing
• scientific article; zbMATH DE number 1305407 (Why is no real title available?)
• New bounds for variable-sized and resource augmented online bin packing
• scientific article; zbMATH DE number 2119702 (Why is no real title available?)
• Optimal Online Algorithms for Multidimensional Packing Problems
• Optimal online bounded space multidimensional packing

This page was built for publication: On variable-sized multidimensional packing

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