Branch-and-cut-and-price algorithm for the constrained-routing and spectrum assignment problem
From MaRDI portal
Publication:6495886
DOI10.1007/S10878-024-01125-XWikidataQ127005647 ScholiaQ127005647MaRDI QIDQ6495886
Youssouf Hadhbi, Ibrahima Diarrassouba, Ali Ridha Mahjoub
Publication date: 2 May 2024
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Cites Work
- Unnamed Item
- A note on two problems in connexion with graphs
- Routing and wavelength assignment in optical networks using bin packing based algorithms
- Geometric algorithms and combinatorial optimization
- The complexity of cover inequality separation
- Integer programming models for the routing and spectrum allocation problem
- Algorithms for the Weight Constrained Shortest Path Problem
- Solving the Static Design Routing and Wavelength Assignment Problem
- Solving Large-Scale Zero-One Linear Programming Problems
- A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing
- Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW
- A tutorial on branch and cut algorithms for the maximum stable set problem
- Reducibility among Combinatorial Problems
- On the facial structure of set packing polyhedra
- The constrained-routing and spectrum assignment problem: valid inequalities and branch-and-cut algorithm
This page was built for publication: Branch-and-cut-and-price algorithm for the constrained-routing and spectrum assignment problem