BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Computational Optimisation Group - ECPv6.15.11//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Computational Optimisation Group
X-ORIGINAL-URL:http://optimisation.doc.ic.ac.uk
X-WR-CALDESC:Events for Computational Optimisation Group
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:Europe/London
BEGIN:DAYLIGHT
TZOFFSETFROM:+0000
TZOFFSETTO:+0100
TZNAME:BST
DTSTART:20180325T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0100
TZOFFSETTO:+0000
TZNAME:GMT
DTSTART:20181028T010000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:+0000
TZOFFSETTO:+0100
TZNAME:BST
DTSTART:20190331T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0100
TZOFFSETTO:+0000
TZNAME:GMT
DTSTART:20191027T010000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:+0000
TZOFFSETTO:+0100
TZNAME:BST
DTSTART:20200329T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0100
TZOFFSETTO:+0000
TZNAME:GMT
DTSTART:20201025T010000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Europe/London:20190502T133000
DTEND;TZID=Europe/London:20190502T143000
DTSTAMP:20260703T230406
CREATED:20190410T081934Z
LAST-MODIFIED:20190410T081934Z
UID:1222-1556803800-1556807400@optimisation.doc.ic.ac.uk
SUMMARY:Seminar: Exact and heuristic MIP methods for the solution of MINLP - Examples from  gas transport optimization problems
DESCRIPTION:Title: Exact and heuristic MIP methods for the solution of MINLP – Examples from gas transport optimization problems\nSpeaker: Dr Lars Schewe\nAffiliation: Dept of Mathematics\, FAU Erlangen-Nürnberg\nLocation: 217 Huxley Building\nTime: 13:30 – 14:30 \nAbstract. In this talk\, we present exact and heuristic methods for MINLP\, the development of which was motivated by applications in gas transport optimization. In this talk\, we present a sample of our approaches and focus on provable results for both the exact and the heuristic methods. The methods have been applied on both academic and real-world instances. We first discuss how to solve MINLPs using a hierarchy of piece-wise linear relaxations and discuss a convergence result for such an algorithm. We show how this algorithm performs on problems in instationary gas transport. We then show how we can use a combination of penalty and alternating-direction methods to solve difficult instances of gas transport optimization problems and on instances from the MINLPLib. For these methods\, we can also give convergence results and discuss their relation to feasibility pump methods.
URL:http://optimisation.doc.ic.ac.uk/event/seminar-exact-and-heuristic-mip-methods-for-the-solution-of-minlp-examples-from-gas-transport-optimization-problems/
END:VEVENT
END:VCALENDAR