New polynomial-time cycle-canceling algorithms for minimum-cost flows (Q4509383)
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: New polynomial-time cycle-canceling algorithms for minimum-cost flows |
scientific article; zbMATH DE number 1517144
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | New polynomial-time cycle-canceling algorithms for minimum-cost flows |
scientific article; zbMATH DE number 1517144 |
Statements
4 October 2001
0 references
minimum-cost flow problem
0 references
convex cost-flow problem
0 references
cycle-canceling algorithm
0 references
strongly polynomial algorithms
0 references
scaling algorithms
0 references
network flows
0 references
New polynomial-time cycle-canceling algorithms for minimum-cost flows (English)
0 references
0.91487753
0 references
0.9101133
0 references
0 references
0 references
0.89889526
0 references
0.8981018
0 references
0.8920621
0 references
0 references
0.8878864
0 references
