Login / Signup
New classes of fast lower bounds for bin packing problems.
Sándor P. Fekete
Jörg Schepers
Published in:
Math. Program. (2001)
Keyphrases
</>
packing problem
lower bound
cutting stock
bin packing
upper bound
objective function
lot sizing
np hard
branch and bound
integer programming
lower and upper bounds
feature selection
optimal solution
supply chain
worst case
branch and bound algorithm