-Steiner Forests Via the Lagrangian Relaxation Technique with Internal Preprocessing.
Danny SegevGil SegevPublished in: ESA (2006)
Keyphrases
- lagrangian relaxation
- preprocessing
- integer programming
- feasible solution
- lower bound
- np hard
- linear programming
- branch and bound algorithm
- column generation
- dynamic programming
- lower and upper bounds
- dual decomposition
- relaxation algorithm
- capacity constraints
- lagrangian heuristic
- shortest path
- mixed integer programming
- mixed integer linear programs
- tabu search
- valid inequalities
- subgradient method
- linear program
- network design problem
- mixed integer program
- feature extraction
- cutting plane
- evolutionary algorithm
- learning algorithm
- neural network