Solving Steiner Tree Problems in Graphs with Lagrangian Relaxation.
Laura BahienseFrancisco BarahonaOscar PortoPublished in: J. Comb. Optim. (2003)
Keyphrases
- lagrangian relaxation
- steiner tree
- facility location
- subgradient method
- mixed integer program
- lagrangian dual
- branch and bound algorithm
- lower bound
- combinatorial optimization
- np hard
- integer programming
- lower and upper bounds
- feasible solution
- optimization problems
- neural network
- graph theory
- weighted graph
- cutting plane algorithm
- relaxation algorithm
- search space