The routing and spectrum allocation problem: a combinatorial optimization survey

DOI10.1007/S43069-025-00498-XMaRDI QIDQ6933492zbMATH OpenFDO

Authors Marcelo Bianchetti, Javier Marenco

Publication date 4 September 2025

Published in SN Operations Research Forum (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S43069-025-00498-X

zbMATH Keywords

networkingoptical fiberrouting and spectrum allocationsurvey

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Communication networks in operations research (90B18) Combinatorial optimization (90C27)

Cites work

• A new implementation of Yen's ranking loopless paths algorithm
• An algorithm for finding shortest routes from all source nodes to a given destination in general networks
• Cycles and spanning trees
• Enumeration of the Elementary Circuits of a Directed Graph
• Finding All the Elementary Circuits of a Directed Graph
• Finding the K Shortest Loopless Paths in a Network
• scientific article; zbMATH DE number 3735858 (Why is no real title available?)
• Logic-based Benders decomposition
• Modeling and optimization of cloud-ready and content-oriented networks
• On superperfection of edge intersection graphs of paths
• Optimal listing of cycles and st-paths in undirected graphs
• The choice of the best among the shortest routes in transparent optical networks
• Towards optimal and scalable solution for routing and spectrum allocation
• Valid inequalities and a branch-and-cut algorithm for the routing and spectrum allocation problem

This page was built for publication: The routing and spectrum allocation problem: a combinatorial optimization survey

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6933492)