The network design problem with relays.
Edgar Alberto CabralErhan ErkutGilbert LaporteRaymond A. PattersonPublished in: Eur. J. Oper. Res. (2007)
Keyphrases
- network design problem
- approximation algorithms
- network design
- branch and bound
- benders decomposition
- transportation networks
- minimal cost
- mixed integer
- integer programming
- mixed integer programming
- lagrangian relaxation
- valid inequalities
- traveling salesman problem
- communication networks
- exact solution
- lagrangian heuristic
- bayesian networks
- branch and bound algorithm
- shortest path
- upper bound
- search algorithm