Strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives (Q5415463): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q493658 |
Changed an Item |
||
| Property / author | |||
| Property / author: László A. Végh / rank | |||
Normal rank | |||
Revision as of 19:17, 15 February 2024
scientific article; zbMATH DE number 6294558
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives |
scientific article; zbMATH DE number 6294558 |
Statements
Strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives (English)
0 references
13 May 2014
0 references
convex optimization
0 references
market equilibrium
0 references
network flow algorithms
0 references
strongly polynomial algorithms
0 references
