A strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives (Q2817799)
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 Strongly Polynomial Algorithm for a Class of Minimum-Cost Flow Problems with Separable Convex Objectives |
scientific article; zbMATH DE number 6621969
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives |
scientific article; zbMATH DE number 6621969 |
Statements
2 September 2016
0 references
network flow algorithms
0 references
convex optimization
0 references
strongly polynomial algorithms
0 references
market equilibrium computation
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
A strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives (English)
0 references
