A decomposition approach for solving a broadcast domination network design problem.
Siqian ShenJ. Cole SmithPublished in: Ann. Oper. Res. (2013)
Keyphrases
- network design problem
- network flow problem
- network design
- approximation algorithms
- benders decomposition
- minimal cost
- branch and bound
- integer programming
- mixed integer
- lagrangian relaxation
- mixed integer programming
- lp relaxation
- transportation networks
- lagrangian dual
- search algorithm
- graphical models
- evolutionary algorithm
- lower bound