Optimal placement of add/drop multiplexers: Static and dynamic models

DOI10.1016/S0377-2217(97)00021-0zbMath0943.90009OpenAlexW1966053565WikidataQ127012947 ScholiaQ127012947MaRDI QIDQ1295992

Alain Sutter, Nicolas Boissin, Laurence A. Wolsey, Gaetan Belvaux

Publication date: 11 July 1999

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(97)00021-0

zbMATH Keywords

optimizationcommunicationheuristicsinteger programming

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Approximation methods and heuristics in mathematical programming (90C59) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Related Items (6)

An iterative heuristic for passenger-centric train timetabling with integrated adaption times ⋮ Algorithms for distributing telecommunication traffic on a multiple-ring SONET-based network. ⋮ Worst case analysis of relax and fix heuristics for lot-sizing problems ⋮ Optimal placement of add/drop multiplexers: Static and dynamic models ⋮ Splittable traffic partition in WDM/SONET rings to minimize SONET ADMs ⋮ Looking ahead with the pilot method

Cites Work

• Optimal placement of add/drop multiplexers: Static and dynamic models
• Integer knapsack and flow covers with divisible coefficients: Polyhedra, optimization and separation
• Optimal Placement of Add/Drop Multiplexers: Heuristic and Exact Algorithms
• Shortest paths, single origin‐destination network design, and associated polyhedra

This page was built for publication: Optimal placement of add/drop multiplexers: Static and dynamic models