A characterization of the two-commodity network design problem.
S. Trilochan SastryPublished in: Networks (2000)
Keyphrases
- network design problem
- approximation algorithms
- network design
- heuristic solution
- branch and bound
- benders decomposition
- network flow problem
- mixed integer programming
- minimal cost
- transportation networks
- mixed integer
- integer programming
- valid inequalities
- lagrangian relaxation
- special case
- lagrangian heuristic
- constraint satisfaction problems
- evolutionary algorithm
- lower bound