A capacity-rounding algorithm for the minimum-cost circulation problem: A dual framework of the Tardos algorithm (Q3731344)
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 capacity-rounding algorithm for the minimum-cost circulation problem: A dual framework of the Tardos algorithm |
scientific article; zbMATH DE number 3963535
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A capacity-rounding algorithm for the minimum-cost circulation problem: A dual framework of the Tardos algorithm |
scientific article; zbMATH DE number 3963535 |
Statements
A capacity-rounding algorithm for the minimum-cost circulation problem: A dual framework of the Tardos algorithm (English)
0 references
1986
0 references
capacity-rounding algorithm
0 references
strongly polynomial algorithm
0 references
minimum-cost circulation problem
0 references
maximum flow
0 references
computational complexity
0 references
shortest path
0 references
0.8768527507781982
0 references
0.8692078590393066
0 references
0.8684762120246887
0 references
0.8579815030097961
0 references
