Online LIB problems: Heuristics for Bin Covering and lower bounds for Bin Packing.

Luke Finlay Prabhu Manyem

Published in: RAIRO Oper. Res. (2005)

Keyphrases

bin packing
graph colouring
cutting stock
lower bound
online learning
assembly line balancing
optimization problems
packing problem
search methods
online algorithms
round robin
heuristic methods
database systems
np complete
upper bound
scheduling problem
search algorithm