Show simple item record

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

dc.contributor.authorDiarrassouba, Ibrahima
dc.contributor.authorHadhbi, Youssouf
hal.structure.identifierLaboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
dc.contributor.authorMahjoub, Ali Ridha
dc.date.accessioned2021-11-15T15:58:01Z
dc.date.available2021-11-15T15:58:01Z
dc.date.issued2021
dc.identifier.urihttps://basepub.dauphine.psl.eu/handle/123456789/22208
dc.language.isoenen
dc.subjectconstrained-routingen
dc.subjectOptical networksen
dc.subjectspectrum assignmenten
dc.subjectinteger linear programmingen
dc.subjectpolyhedronen
dc.subjectdimensionen
dc.subjectvalid inequalityen
dc.subjectfaceten
dc.subject.ddc003en
dc.titleOn the Facial Structure of the Constrained-Routing and Spectrum Assignment Polyhedron: Part Ien
dc.typeDocument de travail / Working paper
dc.description.abstractenThe 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.en
dc.publisher.cityParisen
dc.relation.ispartofseriestitlePreprint Lamsadeen
dc.subject.ddclabelRecherche opérationnelleen
dc.description.ssrncandidatenon
dc.description.halcandidatenonen
dc.description.readershiprechercheen
dc.description.audienceInternationalen
dc.date.updated2021-11-15T15:57:12Z
hal.author.functionaut
hal.author.functionaut
hal.author.functionaut


Files in this item

Thumbnail
Name:
DHM_Polyhedral1.pdf
Size:
709.7Kb
Format:
PDF
View/Open

This item appears in the following Collection(s)

Show simple item record