Efficient heuristics for determining node-disjoint path pairs visiting specified nodes (Q6496358)
From MaRDI portal
scientific article; zbMATH DE number 7841995
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient heuristics for determining node-disjoint path pairs visiting specified nodes |
scientific article; zbMATH DE number 7841995 |
Statements
Efficient heuristics for determining node-disjoint path pairs visiting specified nodes (English)
0 references
3 May 2024
0 references
resilient routing
0 references
visiting a given set of nodes
0 references
min-sum
0 references
heuristics
0 references
node-disjoint path pair
0 references
path-based formulation
0 references
0 references
0 references
