Strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives

DOI10.1145/2213977.2213981zbMath1286.05063OpenAlexW2072713008MaRDI QIDQ5415463

László A. Végh

Publication date: 13 May 2014

Published in: Proceedings of the forty-fourth annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.747.1275

zbMATH Keywords

convex optimizationmarket equilibriumstrongly polynomial algorithmsnetwork flow algorithms

Mathematics Subject Classification ID

Auctions, bargaining, bidding and selling, and other market models (91B26) Flows in graphs (05C21)

Related Items (9)

A Complementary Pivot Algorithm for Market Equilibrium under Separable, Piecewise-Linear Concave Utilities ⋮ Polyhedral Complementarity on a Simplex. Potentiality of Regular Mappings ⋮ Resolving Braess's paradox in random networks ⋮ Market equilibrium under piecewise Leontief concave utilities ⋮ Fair Division of Indivisible Goods for a Class of Concave Valuations ⋮ Scheduling for electricity cost in a smart grid ⋮ A Strongly Polynomial Algorithm for Generalized Flow Maximization ⋮ Polynomial-time algorithms for submodular Laplacian systems ⋮ Scheduling for Electricity Cost in Smart Grid

This page was built for publication: Strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives