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:20161103T163000
DTEND;TZID=UTC:20161103T163000
DTSTAMP:20260517T023048
CREATED:20170116T150029Z
LAST-MODIFIED:20170116T150029Z
UID:434-1478190600-1478190600@optimisation.doc.ic.ac.uk
SUMMARY:Seminar: On the Passage From Local to Global in Optimization - New Challenges in Theory and Practice
DESCRIPTION:Title: On the Passage From Local to Global in Optimization – New Challenges in Theory and Practice\nSpeaker: Prof. Panos M. Pardalos\nAffiliation: Departments of Industrial and Systems and Biomedical Engineering – University of Florida\nLocation: Room 145 Huxley Building\nTime: 4:30pm (1 hour) \nAbstract. Large scale problems in the design of networks\, energy systems\, medicine and drug design\, in finance\, and engineering are modeled as optimization problems. Humans and nature are constantly optimizing to minimize costs or maximize profits\, to maximize the flow in a network\, or to minimize the probability of a blackout in the smart grid. Due to new algorithmic developments and the computational power of machines\, optimization algorithms have been used to solve problems in a wide spectrum of applications in science and engineering. In this talk we are going to address new challenges in the theory and practice of optimization. First\, we have to reflect back a few decades and see what has been achieved and then address the new research challenges and new directions. \nAbout the speaker. Panos Pardalos is a Distinguished Professor in the Departments of Industrial and Systems and Biomedical Engineering at the University of Florida\, and a world renowned leader in Global Optimization\, Mathematical Modeling\, and Data Sciences. He is currently a Fellow of AAAS\, AIMBE\, and INFORMS and was awarded the 2013 Constantin Caratheodory Prize of the International Society of Global Optimization. In addition\, Dr. Pardalos has been awarded the 2013 EURO Gold Medal prize bestowed by the Association for European Operational Research Societies. This medal is the preeminent European award given to Operations Research (OR) professionals for “scientific contributions that stand the test of time.” Prof. Pardalos is also an elected Member of the New York Academy of Sciences\, the Lithuanian Academy of Sciences\, the Royal Academy of Spain\, and the National Academy of Sciences of Ukraine. He is the Founding Editor of Optimization Letters\, Energy Systems\, and Co-Founder of the International Journal of Global Optimization. He has published over 500 papers\, edited/authored over 200 books and organized over 80 conferences. He has about 34\,000 citations on his work\, an H-index of 81\, an I10-index of 472 (Google Scholar) and has graduated 60 PhD students so far.
URL:http://optimisation.doc.ic.ac.uk/event/seminar-on-the-passage-from-local-to-global-in-optimization-new-challenges-in-theory-and-practice/
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=UTC:20161107T143000
DTEND;TZID=UTC:20161107T143000
DTSTAMP:20260517T023048
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