Polynomial algorithms for a class of minimum rank-two cost path problems (Q1567071)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1455287
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polynomial algorithms for a class of minimum rank-two cost path problems |
scientific article; zbMATH DE number 1455287 |
Statements
Polynomial algorithms for a class of minimum rank-two cost path problems (English)
0 references
5 June 2000
0 references
global optimization
0 references
low rank monotonicity
0 references
polynomial algorithm
0 references
shortest path
0 references
Dijkstra's algorithm
0 references
directed path of minimum rank-two monotonic cost
0 references
0.7769955396652222
0 references
0.7638264894485474
0 references
0.7613070011138916
0 references
