BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//132.216.98.100//NONSGML kigkonsult.se iCalcreator 2.20.4//
BEGIN:VEVENT
UID:20251211T015700EST-4784IeRlvw@132.216.98.100
DTSTAMP:20251211T065700Z
DESCRIPTION:Title: Generalized flow\, the net present value problem\, and a
 n open question in arithmetic computationAbstract:In the maximum generaliz
 ed flow problem\, the goal is to send as much flow as possible through a g
 iven network\, but with the additional ingredient that flow is scaled as i
 t traverses each arc. The model is very classical\, dating back to the pap
 er by Kantorovich that introduced the notion of linear programming. Only r
 ecently\, a strongly polynomial algorithm for this problem -- an algorithm
  that is efficient in a certain refined sense -- was provided by Végh. We 
 give a new strongly polynomial algorithm that is both substantially faster
  and dramatically simpler. I will discuss the implications of our result f
 or a classical problem in project scheduling\, and how this brings to ligh
 t a new algorithmic question in arithmetic.(Includes joint work with L. Vé
 gh\, as well as J. Correa\, A. Schulz and L. Végh.) 
DTSTART:20200124T210000Z
DTEND:20200124T220000Z
LOCATION:Room 708\, Burnside Hall\, CA\, QC\, Montreal\, H3A 0B9\, 805 rue 
 Sherbrooke Ouest
SUMMARY:Neil Olver (London School of Economics adn Political Science)
URL:/mathstat/channels/event/neil-olver-london-school-
 economics-adn-political-science-304113
END:VEVENT
END:VCALENDAR