Integrality gap of the vertex cover linear programming relaxation.
Mohit SinghPublished in: Oper. Res. Lett. (2019)
Keyphrases
- integrality gap
- linear programming relaxation
- approximation algorithms
- knapsack problem
- lower bound
- linear programming
- column generation
- branch and bound
- integer programming
- integer program
- mixed integer programming
- feasible solution
- valid inequalities
- np hard
- branch and bound algorithm
- worst case
- integer programming formulation
- optimal solution
- primal dual
- linear program
- special case
- upper bound
- traveling salesman problem