Polynomial algorithms for a class of minimum rank-two cost path problems (Q1567071): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 04:56, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial algorithms for a class of minimum rank-two cost path problems |
scientific article |
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
