Shortest paths in networks with vector weights (Q795755)
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: Shortest paths in networks with vector weights |
scientific article; zbMATH DE number 3862962
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Shortest paths in networks with vector weights |
scientific article; zbMATH DE number 3862962 |
Statements
Shortest paths in networks with vector weights (English)
0 references
1985
0 references
For a directed network in which vector weights are assigned to arcs, the Pareto analog to the shortest path problem is analyzed. An algorithm is presented for obtaining all Pareto shortest paths from a specified node to every other node.
0 references
directed network
0 references
vector weights
0 references
Pareto shortest paths
0 references
0.92752254
0 references
0.9145328
0 references
0.91082114
0 references
0.9044364
0 references
0.9042494
0 references
0.89857006
0 references
0.8982797
0 references
0 references
