An exact lexicographic approach for the maximally risk-disjoint/minimal cost path pair problem in telecommunication networks (Q2146374)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An exact lexicographic approach for the maximally risk-disjoint/minimal cost path pair problem in telecommunication networks |
scientific article; zbMATH DE number 7542724
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An exact lexicographic approach for the maximally risk-disjoint/minimal cost path pair problem in telecommunication networks |
scientific article; zbMATH DE number 7542724 |
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
0.8244562149047852
0 references
0.8217681646347046
0 references
0.8070802688598633
0 references
0.7843712568283081
0 references
0.756943941116333
0 references
