An exact approach for finding bicriteria maximally SRLG-disjoint/shortest path pairs in telecommunication networks

DOI10.1080/03155986.2023.2228021MaRDI QIDQ6138511zbMATH OpenFDO

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

Publication date 5 September 2023

Published in INFOR: Information Systems and Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/03155986.2023.2228021

zbMATH Keywords

shared risk link groupsresilient routing modelsbicriteria optimisationtelecommunication routing design

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Communication networks in operations research (90B18)

Recommendations

• An exact lexicographic approach for the maximally risk-disjoint/minimal cost path pair problem in telecommunication networks
• Efficient calculation of the most reliable pair of link disjoint paths in telecommunication networks
• On a relaxed maximally disjoint path pair problem: a bicriteria approach
• Constrained shortest link-disjoint paths selection: a network programming based approach
• Finding non-dominated bicriteria shortest pairs of disjoint simple paths
• Bicriteria shortest path in networks of queues
• Finding Disjoint Routes in Telecommunications Networks with Two Technologies
• An empirical investigation of some bicriterion shortest path algorithms
• A parametric approach to solving bicriterion shortest path problems
• Bicriterion shortest paths in stochastic time-dependent networks

Cites work

• A bicriterion shortest path algorithm
• A comparison of solution strategies for biobjective shortest path problems
• A new implementation of Yen's ranking loopless paths algorithm
• An exact lexicographic approach for the maximally risk-disjoint/minimal cost path pair problem in telecommunication networks
• Deviation algorithms for ranking shortest paths
• Finding the K Shortest Loopless Paths in a Network
• Multi-objective and multi-constrained non-additive shortest path problems
• Multicriteria path and tree problems: discussion on exact algorithms and applications
• Near-shortest and K-shortest simple paths
• On a relaxed maximally disjoint path pair problem: a bicriteria approach

Cited in

(4)

• Valid inequalities for the \(k\)-color shortest path problem
• Efficient calculation of the most reliable pair of link disjoint paths in telecommunication networks
• An exact lexicographic approach for the maximally risk-disjoint/minimal cost path pair problem in telecommunication networks
• Complete Pareto front of the minimal length maximal capacity shortest path problem

This page was built for publication: An exact approach for finding bicriteria maximally SRLG-disjoint/shortest path pairs in telecommunication networks

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