On the Facial Structure of the Constrained-Routing and Spectrum Assignment Polyhedron: Part I
Abstract : The constrained-routing and spectrum assignment (C-RSA) problem is a key issue when dimensioning and designing an optical network. Given an optical network G and a multiset of traffic demand K, it aims at determining for each traffic demand k ∈ K a path and an interval of contiguous slots while satisfying technological constraints and optimizing some linear objective function(s). In this paper, we first introduce an integer linear programming formulation for the C-RSA problem. We further investigate the facial structure of the associated polytope.
https://hal.uca.fr/hal-03287174
Contributor : Youssouf Hadhbi Connect in order to contact the contributor
Submitted on : Thursday, July 15, 2021 - 2:31:09 PM
Last modification on : Saturday, April 2, 2022 - 3:38:02 AM
Long-term archiving on: : Saturday, October 16, 2021 - 6:38:22 PM
Contributor : Youssouf Hadhbi Connect in order to contact the contributor
Submitted on : Thursday, July 15, 2021 - 2:31:09 PM
Last modification on : Saturday, April 2, 2022 - 3:38:02 AM
Long-term archiving on: : Saturday, October 16, 2021 - 6:38:22 PM
File
DHM_Polyhedral_Investigation_H...
Files produced by the author(s)
Licence
Distributed under a Creative Commons Attribution 4.0 International License
