Hybrid Lagrangian relaxation for bandwidth-constrained routing: knapsack decomposition.
Wided OuajaBarry RichardsPublished in: SAC (2005)
Keyphrases
- lagrangian relaxation
- feasible solution
- dynamic programming
- lagrangian dual
- linear programming
- integer programming
- shortest path
- branch and bound algorithm
- column generation
- lower and upper bounds
- lower bound
- tabu search
- knapsack problem
- mixed integer program
- capacity constraints
- optimal solution
- dual decomposition
- np hard
- upper bound
- relaxation algorithm
- lagrangian heuristic
- decomposition methods
- objective function
- decomposition method
- subgradient method
- mixed integer
- routing problem
- ad hoc networks
- routing protocol
- routing algorithm
- convex hull
- mathematical model
- special case
- image segmentation
- single machine scheduling problem
- branch and bound
- cutting plane algorithm
- mixed integer linear programs