Vector bin packing with multiple-choice (extended abstract)

DOI10.1007/978-3-642-13731-0_24MaRDI QIDQ3569895zbMATH OpenOpenAlexFDO

Authors Boaz Patt-Shamir, Dror Rawitz

Publication date 22 June 2010

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

Full work available at URL https://doi.org/10.1007/978-3-642-13731-0_24

Mathematics Subject Classification ID

Approximation algorithms (68W25) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Vector bin packing with multiple-choice
• scientific article; zbMATH DE number 1305407
• Approximation schemes for ordered vector packing problems
• On Multidimensional Packing Problems
• Improved Approximation for Vector Bin Packing

Cited in

(6)

• Approximation and online algorithms for multidimensional bin packing: a survey
• Approximation schemes for generalized two-dimensional vector packing with application to data placement
• Vector bin packing with multiple-choice
• On Multidimensional Packing Problems
• Approximation schemes for generalized \(2\)-dimensional vector packing with application to data placement
• Improved approximation for two-dimensional vector multiple knapsack

This page was built for publication: Vector bin packing with multiple-choice (extended abstract)

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