Comments on the hierarchically structured bin packing problem
DOI10.1016/J.IPL.2014.10.001zbMATH Open1302.68320OpenAlexW2081154217MaRDI QIDQ477673FDOQ477673
Authors: Thomas Lambert, Loris Marchal, Bora Uçar 
Publication date: 9 December 2014
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-01071414v2/file/article.pdf
Recommendations
- Approximation algorithms for a hierarchically structured bin packing problem
- A dense hierarchy of sublinear time approximation schemes for bin packing
- On a generalized bin-packing problem
- On the generalized bin packing problem
- A classification scheme for bin packing theory
- Notes on inverse bin-packing problems
- Some comments on a bin-packing problem of W. Knödel.
- Ranking lower bounds for the bin-packing problem
- Batched bin packing revisited
Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Cites Work
- Title not available (Why is that?)
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Bounds for Assembly Line Balancing Heuristics
- Approximation algorithms for a hierarchically structured bin packing problem
- On computing inverse entries of a sparse matrix in an out-of-core environment
Cited In (2)
This page was built for publication: Comments on the hierarchically structured bin packing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q477673)
