Comments on the hierarchically structured bin packing problem

DOI10.1016/J.IPL.2014.10.001MaRDI QIDQ477673zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

approximation algorithmsbin packingNP-hardness

Mathematics Subject Classification ID

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

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

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Approximation algorithms for a hierarchically structured bin packing problem
• Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
• Bounds for Assembly Line Balancing Heuristics
• On computing inverse entries of a sparse matrix in an out-of-core environment

Cited in

(2)

• Approximation algorithms for a hierarchically structured bin packing problem
• A dynamic programming algorithm for tree-like weighted set packing problem

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)