OR Practice - Lagrangian Relaxation for Testing Infeasibility in VLSI Routing.
Thomas A. FeoDorit S. HochbaumPublished in: Oper. Res. (1986)
Keyphrases
- lagrangian relaxation
- feasible solution
- integer programming
- shortest path
- linear programming
- column generation
- lower and upper bounds
- np hard
- dynamic programming
- dual decomposition
- lower bound
- branch and bound algorithm
- objective function
- routing problem
- single machine scheduling problem
- lagrangian heuristic
- capacity constraints
- network design problem
- routing protocol
- relaxation algorithm
- tabu search
- valid inequalities
- mixed integer programming
- optimal solution
- mixed integer program
- set covering problem
- mixed integer linear programs
- subgradient method