Shortest paths in networks with vector weights (Q795755): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Algorithm 97 / rank | |||
Normal rank | |||
Revision as of 11:09, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Shortest paths in networks with vector weights |
scientific article |
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
