Dynamic Slope Scaling Procedure and Lagrangian Relaxation with Subproblem Approximation.
Siriphong LawphongpanichPublished in: J. Glob. Optim. (2006)
Keyphrases
- lagrangian relaxation
- integer programming
- dynamic programming
- mixed integer program
- lower bound
- relaxation algorithm
- np hard
- lower and upper bounds
- dual decomposition
- linear programming
- column generation
- network design problem
- branch and bound algorithm
- feasible solution
- capacity constraints
- single machine scheduling problem
- approximation algorithms
- integer program
- lagrangian heuristic
- search algorithm
- linear programming relaxation
- shortest path