-Steiner Forests via the Lagrangian Relaxation Technique with Internal Preprocessing.
Danny SegevGil SegevPublished in: Algorithmica (2010)
Keyphrases
- lagrangian relaxation
- preprocessing
- integer programming
- feasible solution
- lower bound
- branch and bound algorithm
- column generation
- linear programming
- lower and upper bounds
- np hard
- dynamic programming
- capacity constraints
- lagrangian heuristic
- dual decomposition
- mixed integer program
- mixed integer programming
- single machine scheduling problem
- relaxation algorithm
- feature extraction
- valid inequalities
- subgradient method
- linear program
- network design problem
- objective function
- np complete
- upper bound
- computational complexity
- mixed integer linear programs
- neural network