Végh, László A. (2012) 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, 19th-22nd May 2012, New York, USA.
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Official URL: | http://cs.nyu.edu/~stoc2012/default.htm |
| Additional Information: | © 2012 ACM |
| Uncontrolled Keywords: | network flow algorithms, convex optimization, strongly polynomial algorithms, market equilibrium |
| Library of Congress subject classification: | Q Science > QA Mathematics > QA75 Electronic computers. Computer science |
| Sets: | Departments > Management |
| Rights: | http://www.lse.ac.uk/library/rights/LSERO.htm |
| Identification Number: | Published item via DOI |
| URL: | http://eprints.lse.ac.uk/45894/ |
Actions (login required)
 |
Record administration - authorised staff only |
