A Strongly Polynomial Algorithm for a Class of Minimum-Cost Flow Problems with Separable Convex Objectives (Q2817799)
From MaRDI portal
scientific article
| 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 |
Statements
A Strongly Polynomial Algorithm for a Class of Minimum-Cost Flow Problems with Separable Convex Objectives (English)
0 references
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
