Sequential Vector Packing
DOI10.1007/978-3-540-74450-4_2zbMATH Open1176.90487OpenAlexW2180627370MaRDI QIDQ3611892FDOQ3611892
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
Recommendations
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)
Cited In (7)
- Title not available (Why is that?)
- On data reduction for dynamic vector bin packing
- Approximation schemes for ordered vector packing problems
- Sequential vector packing
- Vector bin packing with heterogeneous bins: application to the machine reassignment problem
- Packing small vectors
- Tight bounds for online 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)