The Quickest Transshipment Problem (Q2757622): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 14:24, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Quickest Transshipment Problem |
scientific article |
Statements
The Quickest Transshipment Problem (English)
0 references
26 November 2001
0 references
dynamic network
0 references
polynomial-time algorithm
0 references
