Oblivious Rounding and the Integrality Gap.
Uriel FeigeMichal FeldmanInbal Talgam-CohenPublished in: APPROX-RANDOM (2016)
Keyphrases
- integrality gap
- linear programming relaxation
- tight upper and lower bounds
- approximation algorithms
- lower bound
- linear programming
- knapsack problem
- linear program
- branch and bound
- upper bound
- feasible solution
- valid inequalities
- integer programming
- column generation
- mixed integer programming
- arbitrarily close
- integer programming formulation
- mixed integer
- optimal solution
- upper and lower bounds
- primal dual
- np hard
- special case
- integer program
- cutting plane
- branch and bound algorithm
- search algorithm
- genetic algorithm
- constraint programming
- evolutionary algorithm