BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//University of Liverpool Computer Science Seminar System//v2//EN
BEGIN:VEVENT
DTSTAMP:20260922T191334Z
UID:Seminar-dept-358@lxserverM.csc.liv.ac.uk
ORGANIZER:CN=Lutz Oettershagen:MAILTO:Lutz.Oettershagen@liverpool.ac.uk
DTSTART:20141021T130000
DTEND:20141021T140000
SUMMARY:School Seminar Series
DESCRIPTION:Dr Laszlo Vegh: A strongly polynomial algorithm for generalised flow maximisation\n\nGeneralised flows are a classical extension of network flows, where the flow gets multiplied by a certain gain or loss factor while traversing an arc. This is a widely applicable model, as the factors can be used to model physical changes such as leakage or theft; or alternatively, they can represent conversions between different types of entities, e.g. different currencies. The talk presents the first strongly polynomial algorithm for the generalized flow maximisation problem. This used to be the simplest class of linear programmes with no strongly polynomial algorithm known, and finding one has been a longstanding open question. The algorithm is based on a new variant of the classical scaling technique, called continuous scaling.\n\nhttps://www.csc.liv.ac.uk/research/seminars/abstract.php?id=358
LOCATION:Ashton Lecture Theater
END:VEVENT
END:VCALENDAR