[PDF] hal.science

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

I Diarrassouba, Y Hadhbi, AR Mahjoub - 2021 - uca.hal.science
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 …
被引用次数：1 相关文章 所有 8 个版本
[PDF] hal.science

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

I Diarrassouba, Y Hadhbi, AR Mahjoub - 2021 - uca.hal.science
The Constrained-Routing and Spectrum Assignment (C-RSA) problem arises in the
dimensioning and management of a next-generation of optical transport networks, called …
被引用次数：4 相关文章 所有 4 个版本

Branch-and-cut-and-price algorithm for the constrained-routing and spectrum assignment problem

I Diarrassouba, Y Hadhbi, AR Mahjoub - Journal of Combinatorial …, 2024 - Springer
Abstract The Constrained-Routing and Spectrum Assignment (C-RSA) problem arises in the
design of 5 G telecommunication optical networks. Given an undirected, loopless, and …
相关文章 所有 4 个版本
[PDF] hal.science

The constrained-routing and spectrum assignment problem: polyhedral analysis and algorithms

Y Hadhbi - 2022 - theses.hal.science
In this thesis, we study a variant of the Routing and Spectrum Assignment problem (RSA),
namely the Constrained-Routing and Spectrum Assignment (C-RSA). The C-RSA problem is …
被引用次数：1 相关文章 所有 7 个版本

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

I Diarrassouba, Y Hadhbi - International Symposium on Combinatorial …, 2022 - Springer
Abstract We consider the Constrained-Routing and Spectrum Assignment (C-RSA) problem.
Given an undirected, loopless, and connected graph G, an optical spectrum S of available …
被引用次数：1 相关文章 所有 2 个版本
[PDF] hal.science

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

I Diarrassouba, Y Hadhbi, AR Mahjoub - 2021 - uca.hal.science
In this work, we focus on a complex variant of the so-called Routing and Spectrum
Assignment problem (RSA), namely the Constrained-Routing and Spectrum Assignment (C …
被引用次数：1 相关文章 所有 4 个版本

The Constrained-Routing and Spectrum Assignment Problem: Extended Formulation and Branch-and-Cut-and-Price Algorithm

I Diarrassouba, Y Hadhbi… - 2022 8th International …, 2022 - ieeexplore.ieee.org
In this paper, we study the Constrained-Routing and Spectrum Assignment (C-RSA)
problem. Consider an undirected, loopless, and connected graph G. Let S be an optical …
相关文章 所有 2 个版本
[PDF] utdt.edu

A polyhedral study of a relaxation of the routing and spectrum allocation problem

J Marenco, F Bertero, H Kerivin, A Wagler - 2023 - repositorio.utdt.edu
The routing and spectrum allocation (RSA) problem arises in the context of flexible grid
optical networks, and consists in routing a set of demands through a network while …
相关文章
[PDF] sciencedirect.com

A polyhedral study of a relaxation of the routing and spectrum allocation problem (Brief Announcement)

F Bertero, H Kerivin, J Marenco, A Wagler - Procedia Computer Science, 2023 - Elsevier
The routing and spectrum allocation (RSA) problem arises in the context of flexible grid
optical networks, and consists in routing a set of demands through a network while …
相关文章 所有 2 个版本

Solving the routing and spectrum assignment problem, driven by combinatorial properties

PHF da Silva, H Kerivin, JP Nant, AK Wagler - Networks, 2024 - Wiley Online Library
The routing and spectrum assignment problem in modern optical networks is an NP‐hard
problem that has received increasing attention during the last years. The majority of existing …
相关文章 所有 2 个版本