Skip to Main content Skip to Navigation
Journal articles

Comments on the hierarchically structured bin packing problem

Abstract : We study the hierarchically structured bin packing problem. In this problem, the items to be packed into bins are at the leaves of a tree. The objective of the packing is to minimize the total number of bins into which the descendants of an internal node are packed, summed over all internal nodes. We investigate an existing algorithm and make a correction to the analysis of its approximation ratio. Further results regarding the structure of an optimal solution and a strengthened inapproximability result are given.
Complete list of metadatas

Cited literature [5 references]  Display  Hide  Download

https://hal.inria.fr/hal-01071414
Contributor : Equipe Roma <>
Submitted on : Wednesday, October 8, 2014 - 10:12:12 PM
Last modification on : Thursday, November 21, 2019 - 2:33:00 AM
Long-term archiving on: : Friday, January 9, 2015 - 11:40:51 AM

File

article.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Thomas Lambert, Loris Marchal, Bora Uçar. Comments on the hierarchically structured bin packing problem. Information Processing Letters, Elsevier, 2015, 115 (2), pp.306--309. ⟨10.1016/j.ipl.2014.10.001⟩. ⟨hal-01071414v2⟩

Share

Metrics

Record views

671

Files downloads

706