A two-criterion lexicographic algorithm for finding all shortest paths in networks (Q2263347): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Algorithm 97 / rank | |||
Normal rank | |||
Revision as of 22:31, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A two-criterion lexicographic algorithm for finding all shortest paths in networks |
scientific article |
Statements
A two-criterion lexicographic algorithm for finding all shortest paths in networks (English)
0 references
18 March 2015
0 references
multicriteria problem of finding shortest paths
0 references
algorithm
0 references
computational complexity
0 references
