Sequential Vector Packing

DOI10.1007/978-3-540-74450-4_2MaRDI QIDQ3611892zbMATHOpenAlexFDO

Authors Mark Cieliebak, Alexander Hall, Riko Jacob, Marc Nunkesser

Publication date 3 March 2009

Published in Combinatorics, Algorithms, Probabilistic and Experimental Methodologies (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-74450-4_2

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Recommendations

• Sequential vector packing
• scientific article; zbMATH DE number 2016848
• Improved Approximation for Vector Bin Packing
• Approximation schemes for ordered vector packing problems
• scientific article; zbMATH DE number 1833403

Cited in

(7)

• Tight bounds for online vector bin packing
• Sequential vector packing
• Packing small vectors
• Approximation schemes for ordered vector packing problems
• scientific article; zbMATH DE number 1833403 (Why is no real title available?)
• Vector bin packing with heterogeneous bins: application to the machine reassignment problem
• On data reduction for dynamic vector bin packing

This page was built for publication: Sequential Vector Packing

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