On the Equivalence of the Bidirected and Hypergraphic Relaxations for Steiner Tree.
Andreas Emil FeldmannJochen KönemannNeil OlverLaura SanitàPublished in: APPROX-RANDOM (2014)
Keyphrases
- steiner tree
- linear programming relaxation
- lower bound
- linear programming
- knapsack problem
- minimum spanning tree
- shortest path
- facility location
- branch and bound
- column generation
- semidefinite
- np hard
- integer programming
- integer program
- mixed integer programming
- feasible solution
- cutting plane
- social networks
- valid inequalities
- convex optimization
- linear program
- objective function