Parametric programming and Lagrangian relaxation: The case of the network problem with a single side-constraint.
Noel BrysonPublished in: Comput. Oper. Res. (1991)
Keyphrases
- lagrangian relaxation
- capacity constraints
- integer programming
- network design problem
- branch and bound algorithm
- lower bound
- np hard
- feasible solution
- column generation
- single machine scheduling problem
- shortest path
- image segmentation
- linear programming
- dynamic programming
- relaxation algorithm
- dual variables
- lagrangian heuristic
- approximation algorithms
- network design
- network flow
- mixed integer programming
- search space
- subgradient method