An improved lower bound for the bin packing problem

DOI10.1016/0166-218X(96)80459-8zbMath0853.90094MaRDI QIDQ1917305

Bintong Chen, Bharatendu Srivastava

Publication date: 12 December 1996

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

worst-case performancelower boundsone-dimensional bin packing

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (6)

Bin packing and cutting stock problems: mathematical models and exact algorithms ⋮ New bin packing fast lower bounds ⋮ A new destructive bounding scheme for the bin packing problem ⋮ Relaxations and exact solution of the variable sized bin packing problem ⋮ Lower bounds and algorithms for the 2-dimensional vector packing problem ⋮ Fast lifting procedures for the bin packing problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lower bounds and reduction procedures for the bin packing problem
• Probabilistic Analysis of Bin Packing Heuristics

This page was built for publication: An improved lower bound for the bin packing problem