An Improved Lower Bound for the Bin Packing Problem

Authors

Bintong Chen, Washington State University
Bharatendu Srivastava, Marquette UniversityFollow

Document Type

Article

Language

eng

Format of Original

14 p.

Publication Date

1996

Publisher

Elsevier

Source Publication

Discrete Applied Mathematics

Source ISSN

0166-218X

Abstract

This paper unifies and generalizes the existing lower bounds for the one-dimensional bin packing problem. The generalization is motivated by and based on the work of Martello and Toth (this journal, 1990). The worst-case performance of the unified lower bound is analyzed and two new lower bounds are proposed and compared with existing lower bounds through numerical experiments.

Comments

Discrete Applied Mathematics, Volume 66, Issue 1, pp 81-94 (April, 1996). DOI.

Recommended Citation

Chen, Bintong and Srivastava, Bharatendu, "An Improved Lower Bound for the Bin Packing Problem" (1996). Management Faculty Research and Publications. 108.
https://epublications.marquette.edu/mgmt_fac/108