A fast polynomial time algorithm for logistics network flows (Q924394)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A fast polynomial time algorithm for logistics network flows |
scientific article; zbMATH DE number 5276000
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A fast polynomial time algorithm for logistics network flows |
scientific article; zbMATH DE number 5276000 |
Statements
A fast polynomial time algorithm for logistics network flows (English)
0 references
16 May 2008
0 references
multi-tiered logistics network
0 references
combinatorial approximation algorithm
0 references
minimum-cost flow
0 references
global convergence
0 references
minimum congestion
0 references
