The Quickest Transshipment Problem (Q2757622): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Normalize DOI. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1287/moor.25.1.36.15211 / rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2170193147 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1287/MOOR.25.1.36.15211 / rank | |||
Normal rank | |||
Latest revision as of 21:43, 19 December 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
