Optimal placement of add/drop multiplexers: Static and dynamic models
From MaRDI portal
Publication:1295992
Recommendations
- Optimal placement of add/drop multiplexers: Heuristic and exact algorithms
- Assignment of add–drop multiplexer (ADM) rings and digital cross-connect system (DCS) mesh in telecommunication networks
- Location problems in telecommunications
- A model for the design of a minimum-cost telecommunications network
Cites work
- Integer knapsack and flow covers with divisible coefficients: Polyhedra, optimization and separation
- Optimal placement of add/drop multiplexers: Heuristic and exact algorithms
- Optimal placement of add/drop multiplexers: Static and dynamic models
- Shortest paths, single origin‐destination network design, and associated polyhedra
Cited in
(8)- Looking ahead with the pilot method
- Optimal placement of add/drop multiplexers: Heuristic and exact algorithms
- Algorithms for distributing telecommunication traffic on a multiple-ring SONET-based network.
- An optimization method for multiplexer locations
- Splittable traffic partition in WDM/SONET rings to minimize SONET ADMs
- Optimal placement of add/drop multiplexers: Static and dynamic models
- Worst case analysis of relax and fix heuristics for lot-sizing problems
- An iterative heuristic for passenger-centric train timetabling with integrated adaption times
This page was built for publication: Optimal placement of add/drop multiplexers: Static and dynamic models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1295992)