|
Discrete Optimization (DiscOpt I)5 ECTS (englische Bezeichnung: Discrete Optimization)
Modulverantwortliche/r: Alexander Martin Lehrende:
Andreas Bärmann
Startsemester: |
WS 2019/2020 | Dauer: |
1 Semester | Turnus: |
unregelmäßig |
Präsenzzeit: |
45 Std. | Eigenstudium: |
105 Std. | Sprache: |
|
Lehrveranstaltungen:
Empfohlene Voraussetzungen:
Recommended: Linear and Combinatorial Optimization
Inhalt:
Theoretical and practical fundamentals of solving difficult mixed-integer linear
optimization problems (MIPs) constitute the main focus of this lecture. At first, the
concept of NP-completeness and a selection of common NP-complete problems will be
presented. As for polyhedral theory, fundamentals concerning the structure of faces of
convex polyhedra will be covered. Building upon these fundamentals, cutting plane
algorithms as well as branch-and-cut algorithms for solving MIPs will be taught. Finally,
some typical problems of discrete optimization, e.g., the knapsack problem, the
traveling salesman problem or the set packing problem will be discussed.
Lernziele und Kompetenzen:
Students
optimization problems (MIPs),
Literatur:
- Lecture notes
Conforti, Cornuéjols, Zambelli: Integer Programming, Springer 2014
B. Grünbaum, Convex Polytopes, Springer, 2003
B. Korte, J. Vygen: Combinatorial Optimization, Springer 2005
G. L. Nemhauser, L.A. Wolsey: Integer and Combinatorial Optimization, Wiley
1994
A. Schrijver: Theory of Linear and Integer Programming, Wiley 1986
L.A. Wolsey: Integer Programming, Wiley 1998
G. Ziegler, Lectures on Polytopes, Springer, 1995
Studien-/Prüfungsleistungen:
Discrete optimization I (Prüfungsnummer: 59171)
(englischer Titel: Discrete optimization I)
- Prüfungsleistung, mündliche Prüfung, Dauer (in Minuten): 15, benotet, 5 ECTS
- Anteil an der Berechnung der Modulnote: 100.0 %
- Erstablegung: WS 2019/2020, 1. Wdh.: WS 2019/2020
1. Prüfer: | Andreas Bärmann |
|
|
|
|
UnivIS ist ein Produkt der Config eG, Buckenhof |
|
|