|
Date |
Topic |
Notes |
| 1 |
05.10. |
Optimization |
.pdf |
| 2 |
08.10. |
Linear Programming |
.pdf |
| 3 |
10.10. |
The Simplex Method |
.pdf |
| 4 |
12.10. |
Advanced Simplex Procedures |
.pdf |
| 5 |
15.10. |
Complexity of Problems and Algorithms |
.pdf |
| 6 |
17.10. |
The Complexity of Linear Programming |
.pdf |
| 7 |
19.10. |
The Ellipsoid Method |
.pdf |
|
|
Example Sheet 1 |
|
| 8 |
22.10. |
Graphs and Flows |
.pdf |
| 9 |
24.10. |
Transportation and Assignment Problems |
.pdf |
| 10 |
26.10. |
Maximum Flows and Perfect Matchings |
.pdf |
| 11 |
29.10. |
Shortest Paths and Minimum Spanning Trees |
.pdf |
| 12 |
31.10. |
Semidefinite Programming |
.pdf |
| 13 |
02.11. |
Branch and Bound |
.pdf |
| 14 |
05.11. |
Heuristic Algorithms |
.pdf |
| 15 |
07.11. |
Approximation Algorithms |
.pdf |
|
|
Example Sheet 2 |
|
| 16 |
12.11. |
Non-Cooperative Games |
.pdf |
| 17 |
14.11. |
Strategic Equilibrium |
.pdf |
| 18 |
16.11. |
Equilibrium Computation |
.pdf |
| 19 |
19.11. |
Cooperative Games |
.pdf |
| 20 |
21.11. |
Bargaining |
.pdf |
| 21 |
23.11. |
Stable Matchings |
.pdf |
| 22 |
26.11. |
Social Choice |
.pdf |
| 23 |
28.11. |
Mechanism Design |
.pdf |
| 24 |
30.11. |
Mechanisms with Payments |
.pdf |
|
|
Example Sheet 3 |
|
