Determining link weight system under various objectives for OSPF networks using a Lagrangian relaxation-based approach.
Shekhar SrivastavaGaurav AgrawalMichal PióroDeep MedhiPublished in: IEEE Trans. Netw. Serv. Manag. (2005)
Keyphrases
- lagrangian relaxation
- shortest path
- integer programming
- traffic engineering
- feasible solution
- lower bound
- branch and bound algorithm
- dual decomposition
- np hard
- lagrangian heuristic
- dynamic programming
- capacity constraints
- column generation
- linear programming
- lower and upper bounds
- mixed integer linear programs
- relaxation algorithm
- network design
- cutting plane
- mixed integer program
- network structure
- social networks
- lot sizing
- valid inequalities
- upper bound
- subgradient method
- search algorithm