Teaching plan

DateTeacherPlaceTopicLecture notes / comments
29.08.2007Truls Flatberg? B63? Introduction, graph theory? [D] 0, 4.1?
05.09.2007Truls Flatberg? B63? Spanning trees, shortest path? [S] 1.1, 1.2, 1.3, 1.4?
12.09.2007Truls Flatberg? B63? Convexity, polyhedra? [S] 2.1, 2.2 (2.1, 2.6, 2.8, 2.9)?
19.09.2007Truls Flatberg? B63? Linear programming? [S] 2.3, 2.4 (2.15, 2.21, 2.23)
[D] 2.1, 2.2?
26.09.2007? ---? ---? No lecture?
03.10.2007Truls Flatberg? B63? Bipartite matching? [S] 3.1 - 3.6?
10.10.2007Truls Flatberg? B63? Network flow - algorithms and applications? [S] 4.1, 4.2, 4.3, 4.4
[D] 4.4, 4.5?
17.10.2007Truls Flatberg? B63? Network flow - circulation and minimum cost? [S] 4.5, 4.6, 4.7?
24.10.2007Truls Flatberg? B63? Matching? [S] 5.2, 5.3, 5.4?
31.10.2007Truls Flatberg? B63? Integer programming? [S] 8.1 [D] 5.1?
07.11.2007Truls Flatberg? B63? Integer programming - modelling and applications? Demonstration of AMPL.?
14.11.2007Truls Flatberg? B63? Branch and bound? [D] 6.3?
21.11.2007Geir Dahl? B63? Totally unimodular matrices? [S] 8.2, 8.3?
28.11.2007Truls Flatberg? B63? Cutting plane methods? [D] 6.2, 6.4?

[D] G. Dahl, An introduction to convexity, polyhedra and combinatorial optimization

[S] A. Schrijver, A Course in Combinatorial Optimization

Published June 22, 2007 3:42 PM - Last modified Nov. 29, 2007 11:16 PM