×

zbMATH — the first resource for mathematics

Strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives. (English) Zbl 1286.05063
Karloff, Howard J. (ed.) et al., Proceedings of the 44th annual ACM symposium on theory of computing, STOC 2012. New York, NY, USA, May 19–22, 2012. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-1245-5). 27-40 (2012).

MSC:
05C21 Flows in graphs
91B26 Auctions, bargaining, bidding and selling, and other market models
PDF BibTeX XML Cite
Full Text: DOI