An asymptotic approximation scheme for the concave cost bin packing problem

Document Type

Article

Publication Date

12-1-2008

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.

Identifier

43849104606 (Scopus)

Publication Title

European Journal of Operational Research

External Full Text Location

https://doi.org/10.1016/j.ejor.2007.08.031

ISSN

03772217

First Page

582

Last Page

586

Issue

2

Volume

191

Grant

DMI-0300156

Fund Ref

National Science Foundation

This document is currently not available here.

Share

COinS