A branch-and-cut algorithm for the routing and spectrum allocation problem

DOI10.1016/j.dam.2023.06.015arXiv2106.15454OpenAlexW4382466562MaRDI QIDQ6064840

Javier Marenco, Marcelo Bianchetti

Publication date: 11 December 2023

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2106.15454

zbMATH Keywords

integer programmingoptical fibersvalid inequalitiesnetworkingflex-grid

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Cites Work

• Lagrangian decompositions for the two-level FTTx network design problem

This page was built for publication: A branch-and-cut algorithm for the routing and spectrum allocation problem