A combinatorial Benders algorithm for the routing and spectrum allocation problem
Keywords:
routing and spectrum allocation, path protection, combinatorial benders decompositionAbstract
In this work, we present an algorithm based on combinatorial Benders decomposition for the routing and spectrum allocation problem, both with and without path protection. The implementation on randomly generated instances over topologies from the literature shows that this approach is efficient for optimally solving this problem when the objective function seeks to minimize the sum of the lightpath lengths.
Downloads
Published
Issue
Section
License
Copyright (c) 2025 Juan Pablo Lebon, Javier Marenco
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
Acorde a estos términos, el material se puede compartir (copiar y redistribuir en cualquier medio o formato) y adaptar (remezclar, transformar y crear a partir del material otra obra), siempre que a) se cite la autoría y la fuente original de su publicación (revista y URL de la obra), b) no se use para fines comerciales y c) se mantengan los mismos términos de la licencia.
