An exact approach for finding bicriteria maximally SRLG-disjoint/shortest path pairs in telecommunication networks
From MaRDI portal
Publication:6138511
DOI10.1080/03155986.2023.2228021zbMath1520.90075MaRDI QIDQ6138511
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)
shared risk link groupsresilient routing modelsbicriteria optimisationtelecommunication routing design
Programming involving graphs or networks (90C35) Communication networks in operations research (90B18)
Cites Work
- Multi-objective and multi-constrained non-additive shortest path problems
- A comparison of solution strategies for biobjective shortest path problems
- A bicriterion shortest path algorithm
- 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
- Multicriteria path and tree problems: discussion on exact algorithms and applications
- DEVIATION ALGORITHMS FOR RANKING SHORTEST PATHS
- Near-shortest and K-shortest simple paths
- Finding the K Shortest Loopless Paths in a Network
- On a relaxed maximally disjoint path pair problem: a bicriteria approach
This page was built for publication: An exact approach for finding bicriteria maximally SRLG-disjoint/shortest path pairs in telecommunication networks
