On the Facial Structure of the Constrained-Routing and Spectrum Assignment Polyhedron: Part I - Université Paris Dauphine Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2021

On the Facial Structure of the Constrained-Routing and Spectrum Assignment Polyhedron: Part I

Résumé

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.
Fichier principal
Vignette du fichier
DHM_Polyhedral_Investigation_HAL_Rearch_Report_I.pdf (668.12 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03287174 , version 1 (15-07-2021)

Licence

Paternité

Identifiants

  • HAL Id : hal-03287174 , version 1

Citer

Ibrahima Diarrassouba, Youssouf Hadhbi, Ali Ridha Mahjoub. On the Facial Structure of the Constrained-Routing and Spectrum Assignment Polyhedron: Part I. 2021. ⟨hal-03287174⟩
116 Consultations
98 Téléchargements

Partager

Gmail Facebook X LinkedIn More