BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Strongly polynomial algorithm for a class of nonlinear minimum-cos
 t flow problems - László Végh (LSE)
DTSTART:20130211T150000Z
DTEND:20130211T160000Z
UID:TALK42045@talks.cam.ac.uk
CONTACT:Felix Fischer
DESCRIPTION:A well-studied nonlinear extension of the minimum-cost flow pr
 oblem 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 obje
 ctives and multiple market equilibrium computation problems as well. 
LOCATION:MR12\, Centre for Mathematical Sciences\, Wilberforce Road\, Camb
 ridge
END:VEVENT
END:VCALENDAR