An exact lexicographic approach for the maximally risk-disjoint/minimal cost path pair problem in telecommunication networks (Q2146374)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An exact lexicographic approach for the maximally risk-disjoint/minimal cost path pair problem in telecommunication networks |
scientific article |
Statements
An exact lexicographic approach for the maximally risk-disjoint/minimal cost path pair problem in telecommunication networks (English)
0 references
16 June 2022
0 references
lexicographic shortest paths
0 references
ranking
0 references
pairs of paths
0 references
telecommunication network design
0 references
resilient routing models
0 references
