Comments on the hierarchically structured bin packing problem

DOI10.1016/j.ipl.2014.10.001zbMath1302.68320OpenAlexW2081154217MaRDI QIDQ477673

Thomas Lambert, Bora Uçar, Loris Marchal

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

zbMATH Keywords

approximation algorithmsNP-hardnessbin packing

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Cites Work

• Unnamed Item
• Approximation algorithms for a hierarchically structured bin packing problem
• On Computing Inverse Entries of a Sparse Matrix in an Out-of-Core Environment
• Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
• Bounds for Assembly Line Balancing Heuristics

This page was built for publication: Comments on the hierarchically structured bin packing problem