An O(nm)-Time Network Simplex Algorithm for the Shortest Path Problem (Q2770116): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1287/opre.47.3.445 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2099123195 / rank | |||
Normal rank | |||
Latest revision as of 19:14, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An O(nm)-Time Network Simplex Algorithm for the Shortest Path Problem |
scientific article |
Statements
An O(nm)-Time Network Simplex Algorithm for the Shortest Path Problem (English)
0 references
7 February 2002
0 references
shortest paths
0 references
network simplex algorithm
0 references
