A Scalable Solution to Network Design Problems: Decomposition with Exhaustive Routing Search.
Mahmoud FayezIyad A. KatibGeorge N. RouskasTarek F. GharibH. K. AhmedHossam El Deen Mostafa FaheemPublished in: GLOBECOM (2020)
Keyphrases
- network design problem
- search space
- search algorithm
- network flow problem
- network design
- branch and bound
- mixed integer
- benders decomposition
- mixed integer programming
- approximation algorithms
- integer programming
- lagrangian relaxation
- valid inequalities
- minimal cost
- optimal solution
- genetic algorithm
- routing algorithm
- solution quality