A dual simplex algorithm for finding all shortest paths (Q3926369)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A dual simplex algorithm for finding all shortest paths |
scientific article |
Statements
A dual simplex algorithm for finding all shortest paths (English)
0 references
1981
0 references
dual simplex algorithm
0 references
shortest path arborescence
0 references
computational results
0 references
computation of all shortest paths
0 references
