An asymptotic approximation scheme for the concave cost bin packing problem

Leung, Joseph Y.-T. and Li, Chung-Lun

European Journal of Operational Research, 2008, vol. 191, issue 2, pages 582-586

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 [epsilon], there exists a polynomial-time approximation algorithm with an asymptotic worst-case performance ratio of no more than 1Â +Â [epsilon].

Downloads: (external link)
http://www.sciencedi ... bf9c1be2083f0e326aa4
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Access Statistics for this article

European Journal of Operational Research is edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati

More articles in European Journal of Operational Research from Elsevier
Series data maintained by Heidi Boesdal ().