An exact lexicographic approach for the maximally risk-disjoint/minimal cost path pair problem in telecommunication networks

DOI10.1007/S11750-021-00619-9MaRDI QIDQ2146374zbMATH OpenOpenAlexFDO

Authors Marta M. B. Pascoal, José F. Craveirinha, Joao Carlos Namorado Climaco

Publication date 16 June 2022

Published in Top (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s11750-021-00619-9

zbMATH Keywords

rankingtelecommunication network designlexicographic shortest pathspairs of pathsresilient routing models

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Communication networks in operations research (90B18)

Recommendations

• 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
• Efficient calculation of the most reliable pair of link disjoint paths in telecommunication networks
• An effective algorithm for obtaining the minimal cost pair of disjoint paths with dual arc costs
• Finding disjoint paths with related path costs

Cites work

• An efficient algorithm for K shortest simple paths
• Deviation algorithms for ranking shortest paths
• Finding the K Shortest Loopless Paths in a Network
• Multicriteria path and tree problems: discussion on exact algorithms and applications

Cited in

(4)

• An effective algorithm for obtaining the whole set of minimal cost pairs of disjoint paths with dual arc costs
• Shared Risk Link Group disjointness and geodiverse routing: A trade‐off between benefit and practical effort
• Efficient calculation of the most reliable pair of link disjoint paths in telecommunication networks
• An exact approach for finding bicriteria maximally SRLG-disjoint/shortest path pairs in telecommunication networks

Describes a project that uses

Uses Software

• SNDlib

This page was built for publication: An exact lexicographic approach for the maximally risk-disjoint/minimal cost path pair problem in telecommunication networks

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