An asymptotic approximation scheme for the concave cost bin packing problem
Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review
Author(s)
Detail(s)
Original language | English |
---|---|
Pages (from-to) | 582-586 |
Journal / Publication | European Journal of Operational Research |
Volume | 191 |
Issue number | 2 |
Publication status | Published - 1 Dec 2008 |
Externally published | Yes |
Link(s)
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].
Citation Format(s)
An asymptotic approximation scheme for the concave cost bin packing problem. / Leung, Joseph Y.-T.; Li, Chung-Lun.
In: European Journal of Operational Research, Vol. 191, No. 2, 01.12.2008, p. 582-586.
In: European Journal of Operational Research, Vol. 191, No. 2, 01.12.2008, p. 582-586.
Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review