Discrete Optimization (MA3502)
|Lectures:||Prof. Dr. Raymond Hemmecke|
|Exercises:||Dr. René Brandenberg|
|News||Dates of lectures/exercise classes and office hours||Lecture notes||Problem sheets||Literature||FAQ|
- We have added an online multiple-choice problem sheet to the webside. See below.
- For those who have never been taught any basics on complexity theory: Last year's lecture notes include a short summary on complexity theory.
- We have opened a letter box in the basement for handing in the homework.
- First excercises on May, 12th.
- Entry in Handbook of modules
Dates of lectures/exercise classes and office hours
|Lecture||Monday||10:15 - 11:45||MI HS 3||Hemmecke||May, 2nd|
|Excercise class 1||Thursday||16:15 - 18:00 Uhr||02:04:011||Brandenberg||May, 12th|
|Excercise class 2||Friday||12:15 - 14:00 Uhr||02:06:011||Franz||May, 13th|
|Excercise class 3||Friday||12:15 - 14:00 Uhr||02:06:011||Brandenberg||May, 20th|
|Person||Office hours (during semester)|
|Raymond Hemmecke||by appointment|
|René Brandenberg||on appointment|
- Version of July 22, 2011
- Old lecture notes in German: These are last year's lecture notes. This year, I intend to cover essentially the same topics, but with possibly slight adaptations here and there. Thus, this year's lecture notes will be mainly a translation of these old notes into English.
|Problem sheets||Comments||Solution outlines||Supplementary sheets|
|Sheet 01||Sheet 01||Supplementary sheet 01|
|Sheet 02||Sheet 02||Supplementary sheet 02|
|Sheet 03||Sheet 03|
|Sheet 04||Sheet 04|
|Sheet 05||Sheet 05|
Multiple Choice online excercises %SBICON%Please, printout the problem sheet and think about your answers first. Afterwards, when you feel sure about your answers, use the online form for submition and getting results. Please recognize that the data will be anonymized and only given in an aggregate form to the teachers for statical puposes (e.g. how many times Excercise 1.1 a) was correctly answered).
|Problem sheets||Solutions||Online version||Date of announcement||Remarks|
|MC-Sheet||online form||25th of July, 2011||"quadtratic" added in 1.5e)|
- Cook, Cunningham, Pulleyblank, Schrijver, Combinatorial Optimization, Wiley 1998
- Korte, Vygen, Combinatorial Optimization: Theory and Algorithms, Springer 2002
- Nemhauser, Wolsey: Integer and Combinatorial Optimization 1999
- Papadimitriou, Steiglitz, Combinatorial Optimization: Algorithms and Complexity, Dover 1998
- Wolsey: Integer Programming, 1998
FAQHow does the allocation of the excercise classes work?
- The excercises take place almost every two weeks, the exact data can be found under Dates of lectures/exercise classes and office hours.
- The registration into the excersise classes has to be done via TUMonline and takes place between Tuesday, 3rd of May, 6 p.m. and Thursday, 5th of May, 11.59 p.m.
- First, there will only be the excersise classes already listet under Dates of lectures/exercise classes and office hours. In each of the classes a maximum of 15 people can be registered.
- If the number of registrations into one of the groups reaches the limit, we will try to offer an additional class at the same appointed time. If so, we will inform you under News as soon as possible
- As long as the registration is open and there are remaining places, you can subscribe and unsubscribe into the groups as you want.
- However, multiple subscriptions are not allowed.
Yes. Some information about the exams can be found under this link. We will inform you via this web-page as soon as the schedule of the exam is fixed. Do I have to register for the exam?
Yes, you have to register via TUM-Online. A "how-to" can be downloaded here (pdf) Which additives are allowed to be used during the exam?
None, except writing utensils. Am I automatically signed in the repetition exam if I failed the first?
No. How does the Homework system works for this excercises?
- You will get an excercise sheet every two weeks within your excercises class or via this web-page (see Excercise sheets).
- Within the classes the excercises should be discussed within groups to get first drafts of ideas for solutions.
- At home you should carefully write down full solutions in teams of 2 to 3 students.
- After your class you have one week to finish your homework.
- After finishing your homework you drop it in the "Discrete optimization"-marked letter box in the basement of the MI-building.
- Please, write your full name and the number of your excercise class on your homework.
- The corrected homework will be returned to you in the following excercise class.
Non-picked homework will be stored in the shelves at the entrance of the M9-finger till to the end of the semester. Just pick them, if neccesary.