Crosstalk-Constrained Maze Routing Based on Lagrangian Relaxation.
Hai ZhouD. F. WongPublished in: ICCD (1997)
Keyphrases
- lagrangian relaxation
- shortest path
- integer programming
- feasible solution
- np hard
- lower bound
- branch and bound algorithm
- linear programming
- lower and upper bounds
- dynamic programming
- dual decomposition
- column generation
- capacity constraints
- network design problem
- lagrangian heuristic
- routing algorithm
- mixed integer program
- routing problem
- routing protocol
- valid inequalities
- single machine scheduling problem
- mixed integer linear programs
- relaxation algorithm
- constraint satisfaction problems
- data structure
- upper bound
- evolutionary algorithm
- lagrangian dual
- subgradient method
- constraint programming