Optimal placement of add/drop multiplexers: Heuristic and exact algorithms
From MaRDI portal
Recommendations
Cited in
(15)- A ring-mesh topology design problem for optical transport networks
- Cutting plane algorithms for solving a stochastic edge-partition problem
- Optimal placement of add/drop multiplexers: Static and dynamic models
- 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.
- Splittable traffic partition in WDM/SONET rings to minimize SONET ADMs
- Column-Generation in Integer Linear Programming
- A branch-and-cut algorithm for solving an intraring synchronous optical network design problem
- Column generation for stochastic Green telecommunication network planning with switchable base stations
- scientific article; zbMATH DE number 2096645 (Why is no real title available?)
- A column generation approach for SONET ring assignment
- Approximation algorithms for the design of SDH/SONET networks
- Better approximating SONET k-edge partition for small capacity k
This page was built for publication: Optimal placement of add/drop multiplexers: Heuristic and exact algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2781111)