An asymptotic approximation scheme for the concave cost bin packing problem

Research output: Journal Publications and ReviewsRGC 21 - Publication in refereed journalpeer-review

15 Scopus Citations
View graph of relations

Author(s)

Detail(s)

Original languageEnglish
Pages (from-to)582-586
Journal / PublicationEuropean Journal of Operational Research
Volume191
Issue number2
Publication statusPublished - 1 Dec 2008
Externally publishedYes

Abstract

We consider a generalized one-dimensional bin packing model in which the cost of a bin is a nondecreasing concave function of the utilization of the bin. We show that for any given positive constant ε{lunate}, there exists a polynomial-time approximation algorithm with an asymptotic worst-case performance ratio of no more than 1 + ε{lunate}. © 2007 Elsevier B.V. All rights reserved.

Research Area(s)

  • Asymptotic worst-case analysis, Bin packing, Concavity

Bibliographic Note

Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].