An asymptotic approximation scheme for the concave cost bin packing problem
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 [epsilon], there exists a polynomial-time approximation algorithm with an asymptotic worst-case performance ratio of no more than 1Â +Â [epsilon].
Year of publication: |
2008
|
---|---|
Authors: | Leung, Joseph Y.-T. ; Li, Chung-Lun |
Published in: |
European Journal of Operational Research. - Elsevier, ISSN 0377-2217. - Vol. 191.2008, 2, p. 582-586
|
Publisher: |
Elsevier |
Saved in:
Online Resource
Saved in favorites
Similar items by person
-
Scheduling with processing set restrictions : a survey
Leung, Joseph Y.-T., (2008)
-
Berth allocation with time-dependent physical limitations on vessels
Xu, Dongsheng, (2012)
-
Scheduling with processing set restrictions: A survey
Leung, Joseph Y.-T., (2008)
- More ...