On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree.
Andreas Emil FeldmannJochen KönemannNeil OlverLaura SanitàPublished in: Math. Program. (2016)
Keyphrases
- steiner tree
- linear programming relaxation
- lower bound
- minimum spanning tree
- linear programming
- knapsack problem
- shortest path
- facility location
- integer programming
- mixed integer programming
- column generation
- integer program
- branch and bound
- np hard
- feasible solution
- cutting plane
- convex relaxation
- constraint programming
- ant colony optimization