A partition-based relaxation for Steiner trees.
Jochen KönemannDavid PritchardKunlun TanPublished in: Math. Program. (2011)
Keyphrases
- steiner tree
- linear programming relaxation
- shortest path
- linear programming
- facility location
- minimum spanning tree
- lower bound
- knapsack problem
- branch and bound
- column generation
- integer programming
- mixed integer programming
- lagrangian relaxation
- convex relaxation
- feasible solution
- neural network
- computational complexity
- constraint programming
- linear program
- valid inequalities
- optimization problems
- dynamic programming