Die Informatik des Fachbereiches 3 der Universität Bremen Hier geht es zur Homepage der Verwaltung des Fachbereiches 3 der Universität Bremen Hier geht es zur Homepage der Informatik des Fachbereiches 3 der Universität Bremen Hier geht es zur Homepage der Mathematik des Fachbereiches 3 der Universität Bremen Hier geht es zur Homepage des Fachbereiches 3 der Universität Bremen Hier geht es zur Homepage der Universität Bremen


INHALT & PFAD:
Startseite Textformat


Für den Fall, dass Ihr Computer das entsprechende Format nicht angezeigen kann, können Sie sich hier das Dokument als unformatierte Textausgabe ansehen.

(Bitte haben Sie dafür Verständnis, dass gewisse Dokumente nicht als Textalternative zur Verfügung stehen.)


Download:
Download Antrittsvorlesung: Combinatorial Optimization under Uncertainty: Algorithms, Performance Guarantees and Applications in Logistics (application/pdf 102.7 KB)


Textalternate  Antrittsvorlesung: Combinatorial Optimization under Uncertainty: Algorithms, Performance Guarantees and Applications in Logistics
Fulltext:




Einladung zum Vortrag


09. Mai 2017, 16.00 Uhr c.t.
Universität Bremen | Cartesium Rotunde

Prof. Dr. Nicole Megow
Universität Bremen | Fachbereich 3 | Informatik


Antrittsvorlesung: Combinatorial Optimization under
Uncertainty: Algorithms, Performance Guarantees and
Applications in Logistics
Combinatorial optimization problems appear in various application areas, e.g., in logistics, production planning,
communication and financial markets. When solving realworld optimization problems, uncertainty in the input
data is a prevalent issue: resources may become unavailable, material arrives late, jobs may take more or less
time than originally estimated, etc. In this talk, we will discuss models, such as online, stochastic and robust
models, and solution methods for optimization under uncertainty. The main focus will lie on provable
performance guarantees. What is an algorithm that "performs well", even under uncertain input? Exemplarily,
we will consider scheduling problems and show how to design algorithms and derive rigorous worstcase
performance guarantees.
Biografie
Nicole Megow joined the computer science institute at the University of Bremen as a full professor in August 2016. Her
main research interests are in the field of combinational optimization, on the design and analysis of efficient algorithms
with provable performance guarantees. She and her group contribute with theoretic results and apply them to complex
realworld environments, e.g, in production management and logistics.
After her studies at TU Berlin and M.I.T. (Cambridge, US), Nicole Megow received her doctorate in mathematics from TU
Berlin in 2006. She was postdoc and senior research at the Max Planck Institute for Informatics, Saarbrücken, held a
position as interim professor for discrete optimization at TU Darmstadt 2011/12, and headed an Emmy Noether Research
Group at TU Berlin. Before joining the University of Bremen, she was an assistant professor for discrete mathematics at TU
Munich. Her work has won several awards, including the Dissertation Award by the German Operations Research Society
(GOR) and the Heinz MaierLeibnitz Prize by the German Research Foundation (DFG).


Dieser Gast wurde von Kerstin Schill eingeladen.

Microsoft Word - Megow.docx Microsoft Word - Megow.docx jungmann PScript5.dll Version 5.2.2 Acrobat Distiller 10.1.16 (Windows) Thu Apr 06 10:55:17 2017 Thu Apr 06 10:55:17 2017 no 1 no 595.22 x 842 pts (A4) 105200 bytes yes 1.5
Antrittsvorlesung: Combinatorial Optimization under Uncertainty: Algorithms, Performance Guarantees and Applications in Logistics
Antrittsvorlesung: Combinatorial Optimization under Uncertainty: Algorithms, Performance Guarantees and Applications in Logistics


 



zurück  




Seitenanfang  -  Impressum Zuletzt geändert durch: jungmann [b]   06.04.2017 Admin-Login