An improved lower bound for the bin packing problem

Discrete Applied Mathematics

Volumn 66, Issue 1, 1996, Pages 81-94

  Chen, Bintong ^a   Srivastava, Bharatendu ^b  

^a WASHINGTON STATE UNIVERSITY   (United States)

^b MARQUETTE UNIVERSITY   (United States)

Author keywords

Bin packing problem; Lower bound; Worst case analysis

Indexed keywords

EID: 0347695302     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0166-218X(96)80459-8     Document Type: Article

References (6)

1. E.G. Coffman Jr, M.R. Garey and D.S. Johnson, Approximation algorithms for bin-packing - An updated survey, in: G. Ausiello, M. Lucertini and P. Serafini, eds., Algorithm Design for Computer System Design (Springer, Vienna, 1984).
2. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, San Francisco, CA, 1979).
3. Y.-D. Kim and C.A. Yano, Heuristic approaches for loading problems in flexible manufacturing systems, IIE Trans. 25 (1993) 26-39.
4. S. Martello and P. Toth, Lower bounds and reduction procedures for the bin packing problem, Discrete Appl. Math. 28 (1990) 59-70.
5. S. Martello and P. Toth, Knapsack Problems: Algorithms and Computer Implementations, (Wiley, New York, 1990).
6. H.L. Ong, M.J. Magazine and T.S. Wee, Probabilistic analysis of bin packing heuristics, Oper. Res. 32 (1984) 983-998.