Combinatorial Optimization (MA 4502), SoSe 2017Vorlesung
|Lectures:||Prof. Dr. Andreas Schulz|
|Tutorial Management:||Dr. Andreas Alpers|
|Tutorials:||Dr. Andreas Alpers|
|News||Content||Schedule||Slides||Problem sets and solutions||Exam||Literature||Links|
- (10/16) Your grades will be online in the next days (most likely on Tuesday). You have the chance of reviewing your exam on Oct. 20th from 2-3pm in MI 02.06.020.
- (09/05) Grades are online since yesterday. The first exam (including solutions) can be found further down on this web page; see section EXAM. You may review your exam on Sept. 7th from 3-4pm in MI 02.04.011.
- (09/01) Your grades will be online in the next days (most likely on Monday). You have the chance of reviewing your exam on Sept. 7th from 3-4pm in MI 02.04.011.
- (07/14) The PDFs of the two exams from last year can now be found further down on this webpage (see EXAM section).
- (06/19) The exams are scheduled (see below). TUMOnline registration for the first exam closes on June 30th! TUMOnline registration for the second exam closes on Sept. 25th.
- (06/19) In order to make up for some of the missed class meetings, from now on (i.e., starting this Friday, June 23) we will meet from 12:00pm (noon) till 2:00pm.
- (05/11) There won't be lectures on May 26th (Christi Himmelfahrt) and on June 16th ("Brückentag" after Christi Himmelfahrt and Fronleichnam). They will be given at a later date (which will be announced later).
- (05/08) The ebook version of the course text is now available here here. Please log in via your institutional credentials.
- (04/25) The first lecture and exercise groups start in the second week of the semester (i.e.,on May 4th and May 5th, respectively). Signing up for the exercises (via TumOnline) is not mandatory, but would help you to find out which of the groups are rather full.
ContentThis course covers important and modern aspects of combinatorial, discrete and integer optimization that are not considered elsewhere in the curriculum. Topics include the equivalence of separation and optimization, primal separation, augmentation algorithms and local search, the strength of formulations, extended formulations, test sets and Graver bases, mixed-integer programming, robust optimization, and submodular functions.
|Fri||12:00-14:00||MI HS 3|
|1 (Group 3 in TumOnline)||Thu||12-14||00.09.022||May 4th, May 18th, June 1st, June 29th, July 13th, July 27th|
|2||Thu||16-18||02.08.011||May 4th, May 18th, June 1st, June 29th, July 13th, July 27th|
- Lecture 1:
- Lecture 2:
- Lecture 3:
- Lecture 4:
- Lecture 5:
- Lecture 6:
- Lecture 7:
- Lecture 8:
- Lecture 9:
- Lecture 10+11:
Problem sets and solutions
|Problem Set||Suggested Solutions||Remarks|