HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

Valid Inequalities and Branch-and-Cut Algorithm for the Constrained-Routing and Spectrum Assignment Problem

Abstract : The Constrained-Routing and Spectrum Assignment (C-RSA) problem arises in the dimensioning and management of a next-generation of optical transport networks, called Spectrally Flexible Optical Networks (SFONs). The C-RSA can be stated as follows. Given an SFONs as a graph G, and an optical spectrum S of available contiguous frequency slots, and a multiset of traffic demands K, it aims at determining for each demand k ∈ K a path in G and an interval of contiguous slots in S while satisfying technological constraints, and optimizing some linear objective function(s). To the best of our knowledge, a cuttingplane-based approach has not been yet considered for the problem. For that, the main aim of our work is to introduce an integer linear programming formulation and provide several classes of valid inequalities for the associated polyhedron. We further discuss their separation problems. Using the polyhedral results and the separation procedures, we devise a Branchand-Cut algorithm to solve the problem. We also present some computational results and show the effectiveness of our approach using real and some realistic network topologies.
Document type :
Preprints, Working Papers, ...
Complete list of metadata

Contributor : Youssouf Hadhbi Connect in order to contact the contributor
Submitted on : Thursday, July 15, 2021 - 2:21:46 PM
Last modification on : Saturday, April 2, 2022 - 3:38:02 AM
Long-term archiving on: : Saturday, October 16, 2021 - 6:36:23 PM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License


  • HAL Id : hal-03287146, version 1


Ibrahima Diarrassouba, Youssouf Hadhbi, Ali Ridha Mahjoub. Valid Inequalities and Branch-and-Cut Algorithm for the Constrained-Routing and Spectrum Assignment Problem. 2021. ⟨hal-03287146⟩



Record views


Files downloads