The constrained-routing and spectrum assignment problem: valid inequalities and branch-and-cut algorithm

DOI10.1007/978-3-031-18530-4_3MaRDI QIDQ6166888zbMATH OpenFDO

Authors I. Diarrassouba, Youssouf Hadhbi

Publication date 3 August 2023

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-18530-4_3

zbMATH Keywords

branch-and-cutdimensionfacetinteger programmingoptical network designpolyhedronroutingseparationspectrum assignmentvalid inequality

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• Branch-and-cut-and-price algorithm for the constrained-routing and spectrum assignment problem
• A branch-and-cut algorithm for the routing and spectrum allocation problem
• Integer programming models for the routing and spectrum allocation problem
• Solving the routing and spectrum assignment problem, driven by combinatorial properties
• Towards optimal and scalable solution for routing and spectrum allocation

Cites work

• Facets of the Knapsack Polytope From Minimal Covers
• The constrained-routing and spectrum assignment problem: valid inequalities and branch-and-cut algorithm

Cited in

(5)

• Combinatorial approximation algorithms for spectrum assignment problem in chain and ring networks
• 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 the routing and spectrum assignment problem, driven by combinatorial properties
• Branch-and-cut-and-price algorithm for the constrained-routing and spectrum assignment problem

This page was built for publication: The constrained-routing and spectrum assignment problem: valid inequalities and branch-and-cut algorithm

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