A Logarithmic Additive Integrality Gap for Bin Packing.
Rebecca HobergThomas RothvossPublished in: CoRR (2015)
Keyphrases
- bin packing
- integrality gap
- linear programming relaxation
- linear program
- arbitrarily close
- valid inequalities
- lower bound
- graph colouring
- approximation algorithms
- search tree
- finite number
- packing problem
- worst case
- linear programming
- lp relaxation
- knapsack problem
- optimal solution
- integer programming formulation
- primal dual
- traveling salesman problem
- column generation
- integer programming
- feasible solution
- mixed integer programming
- low degree
- np hard