Vector bin packing with multiple-choice (extended abstract)

DOI10.1007/978-3-642-13731-0_24zbMATH Open1285.68217OpenAlexW2998509247MaRDI QIDQ3569895FDOQ3569895

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

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

Mathematics Subject Classification ID

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

Cited In (5)

• Complex-demand scheduling problem with application in smart grid
• On Multidimensional Packing Problems
• Approximation schemes for generalized two-dimensional vector packing with application to data placement
• Vector bin packing with multiple-choice
• Approximation schemes for generalized \(2\)-dimensional vector packing with application to data placement

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)