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

DOI10.1007/978-3-031-18530-4_3zbMath1528.90213MaRDI QIDQ6166888

Ibrahima Diarrassouba, Youssouf Hadhbi

Publication date: 3 August 2023

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

zbMATH Keywords

integer programmingdimensionpolyhedronseparationbranch-and-cutroutingfacetvalid inequalityoptical network designspectrum assignment

Mathematics Subject Classification ID

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

Related Items (2)

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

Cites Work

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

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