The Bidirected Cut Relaxation for Steiner Tree has Integrality Gap Smaller than 2.
Jaroslaw ByrkaFabrizio GrandoniVera TraubPublished in: CoRR (2024)
Keyphrases
- integrality gap
- linear programming relaxation
- steiner tree
- linear programming
- knapsack problem
- lower bound
- tight upper and lower bounds
- integer programming
- feasible solution
- branch and bound
- valid inequalities
- mixed integer programming
- column generation
- integer program
- linear program
- np hard
- approximation algorithms
- branch and bound algorithm
- primal dual
- facility location
- graphical models
- integer programming formulation
- search algorithm