Tight LP‐based lower bounds for wavelength conversion in optical networks

DOI10.1111/j.1467-9574.2007.00351.xzbMath1130.90366OpenAlexW2050681244MaRDI QIDQ5422017

Adrian Zymolka, Arie M. C. A. Koster

Publication date: 26 October 2007

Published in: Statistica Neerlandica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/j.1467-9574.2007.00351.x

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Communication networks in operations research (90B18) Graph theory (including graph drawing) in computer science (68R10) Communication theory (94A05)

Related Items

Compact ILP formulations for the routing and wavelength assignment problem in the design of optical transport networks with regenerators, Solving survivable two-layer network design problems by metric inequalities, Branch-and-Cut Techniques for Solving Realistic Two-Layer Network Design Problems

Uses Software

• CALMA
• CPLEX

Cites Work

• Kneser's conjecture, chromatic number, and homotopy
• Wavelength Conversion in Optical Networks
• Models and solution techniques for frequency assignment problems
• Unnamed Item