Solving the routing and spectrum assignment problem, driven by combinatorial properties

DOI10.1002/NET.22195MaRDI QIDQ6196881zbMATH OpenFDO

Authors Hervé L. M. Kerivin, Annegret K. Wagler

Publication date 15 March 2024

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/NET.22195

zbMATH Keywords

combinatorial propertiesminimum spectrum widthrouting and spectrum assignment problem

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)

Recommendations

• Integer programming models for the routing and spectrum allocation problem
• A branch-and-cut algorithm for the routing and spectrum allocation problem
• The constrained-routing and spectrum assignment problem: valid inequalities and branch-and-cut algorithm
• Solving routing and wavelength assignment problem with maximum edge-disjoint paths
• Branch-and-cut-and-price algorithm for the constrained-routing and spectrum assignment problem

Cites work

• Algorithmic graph theory and perfect graphs
• ILP formulations for the routing and wavelength assignment problem: symmetric systems
• Integer programming models for the routing and spectrum allocation problem
• On superperfection of edge intersection graphs of paths
• Towards optimal and scalable solution for routing and spectrum allocation

Cited in

(4)

• A branch-and-cut algorithm for the routing and spectrum allocation problem
• The constrained-routing and spectrum assignment problem: valid inequalities and branch-and-cut algorithm
• Branch-and-cut-and-price algorithm for the constrained-routing and spectrum assignment problem
• On non-superperfection of edge intersection graphs of paths

This page was built for publication: Solving the routing and spectrum assignment problem, driven by combinatorial properties

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