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:UTC
BEGIN:STANDARD
TZOFFSETFROM:+0000
TZOFFSETTO:+0000
TZNAME:UTC
DTSTART:20150101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=UTC:20161107T143000
DTEND;TZID=UTC:20161107T143000
DTSTAMP:20260418T160108
CREATED:20170116T145746Z
LAST-MODIFIED:20170116T145746Z
UID:430-1478529000-1478529000@optimisation.doc.ic.ac.uk
SUMMARY:Seminar: On Robust Selection Problems
DESCRIPTION:Title: On Robust Selection Problems\nSpeaker: Marc Goerigk\nAffiliation: Department of Management Science – Lancaster University\nLocation: Room LT1 Business School\nTime: 2:30pm (1 hour) \nAbstract. Robust optimisation considers problems that are affected by uncertain data: How can we find a solution that performs well\, even if things don’t go quite as planned? Typically\, adding robustness to a problem makes it harder to solve. The selection problem is maybe the simplest non-trivial combinatorial optimisation problem. Given a set of n items\, the task is to choose p items that maximise some profit. Being that simple\, it is an interesting object of study for complexity in robust optimisation\, as its robust counterparts sometimes turn out to become NP-hard\, sometimes not. In this talk I present some of the complexity results in this area\, which can be surprising. Along the way\, we develop an overview on different approaches to robust optimisation\, and see what they mean for the selection problem. \nAbout the speaker. Marc Goerigk is a Lecturer in the Department of Management Science at Lancaster University. He studied mathematics and computer science at the University of Gottingen\, where he also completed his PhD in applied mathematics in 2012. From 2012 to 2015\, he worked as a Post-Doc at the University of Kaiserslautern. Besides robust optimisation\, his research interests include disaster management and public transportation problems.
URL:http://optimisation.doc.ic.ac.uk/event/seminar-on-robust-selection-problems/
END:VEVENT
END:VCALENDAR