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

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹ️ Information

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

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.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Average on Sundays: 7202.88288288 kWh Drum Building, Madingley Rise Site, West Cambridge Webinar & FW11, Computer Laboratory, William Gates Building.

Other talks

Polar Oceans Seminar Talk Group Work How Far Can Good Go Without God? The Limits of a Naturalistic Ethic How Much Does Homology Really Know? The spread of environmental cost-benefit analysis in UK government, c.1966-1995: representing the public in the Anthropocene TBC
 

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