On a Network Design Problem That Is Intractable on Trees.
Dan BienstockOdile MarcottePublished in: Math. Oper. Res. (1990)
Keyphrases
- network design problem
- network design
- approximation algorithms
- benders decomposition
- branch and bound
- mixed integer programming
- transportation networks
- integer programming
- mixed integer
- minimal cost
- np complete
- search algorithm
- lagrangian relaxation
- computational complexity
- evolutionary algorithm
- valid inequalities
- video sequences
- distributed systems