Optimal Placement of Add/Drop Multiplexers: Heuristic and Exact Algorithms
From MaRDI portal
Publication:2781111
DOI10.1287/opre.46.5.719zbMath0987.90014OpenAlexW1982984907MaRDI QIDQ2781111
François Vanderbeck, Alain Sutter, Laurence A. Wolsey
Publication date: 1 July 2002
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.46.5.719
Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)
Related Items (11)
An exact algorithm for IP column generation ⋮ SONET/SDH ring assignment with capacity constraints ⋮ A tabu search algorithm for self-healing ring network design. ⋮ Algorithms for distributing telecommunication traffic on a multiple-ring SONET-based network. ⋮ A branch-and-cut algorithm for solving an intraring synchronous optical network design problem ⋮ A ring-mesh topology design problem for optical transport networks ⋮ Column-Generation in Integer Linear Programming ⋮ Approximation algorithms for the design of SDH/SONET networks ⋮ Cutting plane algorithms for solving a stochastic edge-partition problem ⋮ Optimal placement of add/drop multiplexers: Static and dynamic models ⋮ Splittable traffic partition in WDM/SONET rings to minimize SONET ADMs
This page was built for publication: Optimal Placement of Add/Drop Multiplexers: Heuristic and Exact Algorithms
