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

DOI10.1111/J.1467-9574.2007.00351.XMaRDI QIDQ5422017zbMATH OpenOpenAlexFDO

Authors Arie M. C. A. Koster, Adrian Zymolka

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) Graph theory (including graph drawing) in computer science (68R10) Communication theory (94A05) Integer programming (90C10) Communication networks in operations research (90B18)

Recommendations

• Algorithms and Computation
• Wavelength conversion in all-optical networks with shortest-path routing
• Wavelength conversion in optical networks
• On column generation formulations for the RWA problem
• scientific article; zbMATH DE number 1962808

Cites work

• scientific article; zbMATH DE number 193411 (Why is no real title available?)
• Kneser's conjecture, chromatic number, and homotopy
• Models and solution techniques for frequency assignment problems
• Wavelength conversion in optical networks

Cited in

(5)

• ILP formulations for the routing and wavelength assignment problem: symmetric systems
• Compact ILP formulations for the routing and wavelength assignment problem in the design of optical transport networks with regenerators
• Branch-and-Cut Techniques for Solving Realistic Two-Layer Network Design Problems
• Sparse and limited wavelength conversion in all-optical tree networks
• Solving survivable two-layer network design problems by metric inequalities

Describes a project that uses

Uses Software

• CALMA
• CPLEX

This page was built for publication: Tight LP‐based lower bounds for wavelength conversion in optical networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5422017)