Approximation Lower Bounds in Online LIB Bin Packing and Covering.
Prabhu ManyemRhonda L. SaltMarc Simon VisserPublished in: J. Autom. Lang. Comb. (2003)
Keyphrases
- bin packing
- lower bound
- online algorithms
- upper bound
- approximation schemes
- search tree
- branch and bound algorithm
- graph colouring
- assembly line balancing
- polynomial time approximation
- online learning
- packing problem
- objective function
- branch and bound
- error bounds
- np hard
- approximation algorithms
- polynomial approximation
- database
- min sum
- genetic algorithm
- approximation guarantees
- optimal solution
- high dimensional
- scheduling problem