New Classes of Lower Bounds for Bin Packing Problems.

Sándor P. Fekete Jörg Schepers

Published in: IPCO (1998)

Keyphrases

packing problem
lower bound
cutting stock
bin packing
upper bound
branch and bound
objective function
lot sizing
worst case
lower and upper bounds
feature selection
optimal solution
heuristic search
branch and bound algorithm
mixed integer linear program