An improved lower bound for the bin packing problem
β Scribed by Bintong Chen; Bharatendu Srivastava
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 870 KB
- Volume
- 66
- Category
- Article
- ISSN
- 0166-218X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
We propose a new scheme for computing lower bounds for the non-oriented bin-packing problem when the bin is a square. It leads to bounds that theoretically dominate previous results. Computational experiments show that the bounds are tight. We also discuss the case where the bin is not a square.
Given N 2 positive integers a 1 , a 2 , . . . , a N with GCD(a 1 , . . . , a N ) = 1, let f N denote the largest natural number which is not a positive integer combination of a 1 , . . . , a N . This paper gives an optimal lower bound for f N in terms of the absolute inhomogeneous minimum of the sta