Computing the asymptotic worst-case of bin packing lower bounds.
Teodor Gabriel CrainicGuido PerboliMiriam PezzutoRoberto TadeiPublished in: Eur. J. Oper. Res. (2007)
Keyphrases
- bin packing
- worst case
- lower bound
- upper bound
- branch and bound algorithm
- search tree
- np hard
- graph colouring
- average case
- branch and bound
- approximation algorithms
- assembly line balancing
- error bounds
- running times
- vc dimension
- packing problem
- optimal solution
- objective function
- computational complexity
- worst case analysis
- sample complexity
- linear programming relaxation
- online algorithms
- sample size
- round robin
- genetic algorithm