Robust spectrum allocation in elastic flexgrid optical networks: complexity and formulations

DOI10.1002/NET.21785MaRDI QIDQ6496366

Arie M. C. A. Koster, Christina Büsing, Martin Tieves, Waldemar Laube, Alexandra Grub

Publication date: 3 May 2024

Published in: Networks (Search for Journal in Brave)

zbMATH Keywords

computational complexityrobust optimizationnetwork designelastic optical networksspectrum allocationMIP formulationsflexgrid optical networks

Mathematics Subject Classification ID

Integer programming (90C10) Communication networks in operations research (90B18) Linear programming (90C05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The traveling salesman problem and its variations
• Incidence matrices and interval graphs
• Lagrangean decomposition/relaxation for the routing and wavelength assignment problem
• Wavelength assignment in multifiber star networks
• Efficient algorithms for interval graphs and circular-arc graphs
• Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem

This page was built for publication: Robust spectrum allocation in elastic flexgrid optical networks: complexity and formulations