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

Strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives In: STOC 2012 - 44th ACM Symposium on Theory of Computing, 2012-05-19 - 2012-05-22, New York,United States,USA.

Copy

Item Type	Conference or Workshop Item (Paper)
Keywords	network flow algorithms,convex optimization,strongly polynomial algorithms,market equilibrium
Departments	Management
Date Deposited	11 Oct 2012 12:37
URI	https://researchonline.lse.ac.uk/id/eprint/45894

Full text not available from this repository.

Atom

BibTeX

OpenURL ContextObject in Span

OpenURL ContextObject

Dublin Core

MPEG-21 DIDL

Data Cite XML

EndNote

HTML Citation

METS

MODS

RIOXX2 XML

Reference Manager

Refer

ASCII Citation

Export

Downloads