An exact approach for finding bicriteria maximally SRLG-disjoint/shortest path pairs in telecommunication networks.
José M. F. CraveirinhaMarta PascoalJoão C. N. ClímacoPublished in: INFOR Inf. Syst. Oper. Res. (2023)
Keyphrases
- shortest path
- bicriteria
- shortest path problem
- telecommunication networks
- protection scheme
- efficient solutions
- road network
- shortest path algorithm
- path length
- routing algorithm
- integer linear programming
- finding the shortest path
- knapsack problem
- linear programming
- combinatorial optimization problems
- directed acyclic graph
- upper bound
- cost function
- shortest distance
- special case