A Partition-Based Relaxation For Steiner Trees
Jochen KönemannDavid PritchardKunlun TanPublished in: CoRR (2007)
Keyphrases
- steiner tree
- linear programming relaxation
- facility location
- linear programming
- shortest path
- knapsack problem
- minimum spanning tree
- lower bound
- lagrangian relaxation
- column generation
- integer programming
- feasible solution
- branch and bound
- mixed integer programming
- integer program
- fuzzy logic
- objective function
- tabu search
- neural network
- graphical models
- cutting plane