This paper presents a decomposition approach for solving a variant of the routing and wavelength assignment (RWA) problem, in which all connection requests are covered by geodesics, i.e., shortest paths with respect to the number of hops. Our …
This work presents a decomposition approach for solving a variant of the routing and wavelength assignment problem, in which all connection requests are covered by shortest paths with respect to the number of hops. Our variant consists in minimizing …