An exact approach for finding bicriteria maximally SRLG-disjoint/shortest path pairs in telecommunication networks (Q6138511)
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 approach for finding bicriteria maximally SRLG-disjoint/shortest path pairs in telecommunication networks |
scientific article; zbMATH DE number 7734447
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An exact approach for finding bicriteria maximally SRLG-disjoint/shortest path pairs in telecommunication networks |
scientific article; zbMATH DE number 7734447 |
Statements
An exact approach for finding bicriteria maximally SRLG-disjoint/shortest path pairs in telecommunication networks (English)
0 references
5 September 2023
0 references
telecommunication routing design
0 references
shared risk link groups
0 references
resilient routing models
0 references
bicriteria optimisation
0 references
0.8839082
0 references
0.8700018
0 references
0.85758597
0 references
0.85230255
0 references
0.85109055
0 references
0.8484631
0 references
0.8461176
0 references
0.8383646
0 references
0.8340591
0 references
