Finding Disjoint Routes in Telecommunications Networks with Two Technologies

DOI10.1287/OPRE.47.1.81MaRDI QIDQ4545694zbMATH OpenOpenAlexFDO

Authors Anne de Jongh, Michel Gendreau, Martine Labbé

Publication date 15 August 2002

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.47.1.81

zbMATH Keywords

Lagrangean relaxationtelecommunications networks

Mathematics Subject Classification ID

Communication networks in operations research (90B18)

Recommendations

• An effective algorithm for obtaining the whole set of minimal cost pairs of disjoint paths with dual arc costs
• Finding disjoint paths with different path-costs: Complexity and algorithms
• Multicommodity network design with discrete node costs
• A model for the design of a minimum-cost telecommunications network
• Minimum cost disjoint paths under arc dependences. Algorithms for practice.

Cited in

(5)

• Designing reliable tree networks with two cable technologies
• Multicriteria movement synchronization scheduling problems and algorithms
• Minimum cost disjoint paths under arc dependences. Algorithms for practice.
• An exact approach for finding bicriteria maximally SRLG-disjoint/shortest path pairs in telecommunication networks
• An effective algorithm for obtaining the whole set of minimal cost pairs of disjoint paths with dual arc costs

This page was built for publication: Finding Disjoint Routes in Telecommunications Networks with Two Technologies

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