Compact ILP formulations for the routing and wavelength assignment problem in the design of optical transport networks with regenerators

DOI10.1007/S13675-015-0043-XzbMath1336.90025OpenAlexW1422122714MaRDI QIDQ286692

F. Blanchet-Sadri, M. Dambrine

Publication date: 25 May 2016

Published in: EURO Journal on Computational Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s13675-015-0043-x

zbMATH Keywords

integer linear programmingnetwork designtelecommunicationsOTNRWA

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Communication networks in operations research (90B18) Deterministic network models in operations research (90B10)

Related Items (1)

Editorial

Cites Work

• Lightpath admission control in dynamic optical transport networks
• Designing WDM optical networks using branch-and-price
• Progress in computational mixed integer programming -- a look back from the other side of the tipping point
• On column generation formulations for the RWA problem
• A Traffic-Grooming Algorithm for Wavelength-Routed Optical Networks
• Mixed Integer Programming: Analyzing 12 Years of Progress
• Tight LP‐based lower bounds for wavelength conversion in optical networks

This page was built for publication: Compact ILP formulations for the routing and wavelength assignment problem in the design of optical transport networks with regenerators