Improving the Integrality Gap for Multiway Cut.
Kristóf BércziKarthekeyan ChandrasekaranTamás KirályVivek MadanPublished in: CoRR (2018)
Keyphrases
- integrality gap
- linear programming relaxation
- linear program
- tight upper and lower bounds
- approximation algorithms
- lower bound
- valid inequalities
- linear programming
- arbitrarily close
- knapsack problem
- integer programming formulation
- primal dual
- upper bound
- feasible solution
- np hardness
- integer programming
- lp relaxation
- learning algorithm
- optimal solution
- production planning
- column generation
- genetic algorithm
- branch and bound
- traveling salesman problem
- np hard
- maximum likelihood