A Scalable Solution to Network Design Problems: Decomposition with Exhaustive Routing Search (Conference Paper) | NSF PAGES

skip to main content

Citation Details

A Scalable Solution to Network Design Problems: Decomposition with Exhaustive Routing Search

Award ID(s):: 1907142

NSF-PAR ID:: 10249207

Author(s) / Creator(s):: Fayez, Mahmoud; Katib, Iyad; Rouskas, George N.; Gharib, Tarek F.; Ahmed, H. K.; Faheem, H.M.

Date Published:: 2020-12-01

Journal Name:: IEEE GLOBECOM 2020

Page Range / eLocation ID:: 1 to 6

Format(s):: Medium: X

Sponsoring Org:: National Science Foundation

Free Publicly Accessible Full Text
Accepted Manuscript1.0
Conference Paper:
https://doi.org/10.1109/GLOBECOM42002.2020.9322439