Improved lower bounds for semi-online bin packing problems.

János Balogh József Békési Gábor Galambos Mihály Csaba Markót

Published in: Computing (2009)

Keyphrases

packing problem
lower bound
cutting stock
online algorithms
upper bound
bin packing
online learning
objective function
lower and upper bounds
np hard
optimal solution
branch and bound
lot sizing
reinforcement learning
branch and bound algorithm
integer programming
image registration