University of Cambridge > Talks.cam > Optimization and Incentives Seminar > Strongly polynomial algorithm for a class of nonlinear minimum-cost flow problems

Strongly polynomial algorithm for a class of nonlinear minimum-cost flow problems

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Felix Fischer.

A well-studied nonlinear extension of the minimum-cost flow problem is replacing the linear objective by a separable convex one. We give a strongly polynomial algorithm for finding an exact optimal solution for a broad class of such problems. This class includes convex quadratic objectives and multiple market equilibrium computation problems as well.

This talk is part of the Optimization and Incentives Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2020 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity