Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/1845
Title: | An asymptotic approximation scheme for the concave cost bin packing problem | Authors: | Leung, JY Li, CL |
Issue Date: | 1-Dec-2008 | Source: | European journal of operational research, 1 Dec. 2008, v. 191, no. 2, p. 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 Є, there exists a polynomial-time approximation algorithm with an asymptotic worst-case performance ratio of no more than 1 + Є. | Keywords: | Bin packing Concavity Asymptotic worst-case analysis |
Publisher: | Elsevier | Journal: | European journal of operational research | ISSN: | 0377-2217 | EISSN: | 1872-6860 | DOI: | 10.1016/j.ejor.2007.08.031 | Rights: | European Journal of Operational Research © 2007 Elsevier B.V. The journal web site is located at http://www.sciencedirect.com. |
Appears in Collections: | Journal/Magazine Article |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
57 Final-Version.pdf | Pre-published version | 129.08 kB | Adobe PDF | View/Open |
Page views
120
Last Week
0
0
Last month
Citations as of Apr 14, 2024
Downloads
200
Citations as of Apr 14, 2024
SCOPUSTM
Citations
15
Last Week
0
0
Last month
0
0
Citations as of Apr 19, 2024
WEB OF SCIENCETM
Citations
2
Last Week
0
0
Last month
0
0
Citations as of Apr 18, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.