A two-criterion lexicographic algorithm for finding all shortest paths in networks (Q2263347): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10559-014-9666-9 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2080217460 / rank | |||
Normal rank | |||
Revision as of 20:09, 19 March 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
