INF-MAT5360 - Autumn 2008

Teaching plan

When referring to the curriculum the following abbreviations are used:

  • [S]: Schrijver, A Course in Combinatorial Optimization
  • [D]: Dahl, An introduction to convexity, ...
  • [X]: Gueret et al, Applications of optimization with Xpress-MP

I will make available Lecture notes after (or slightly before) each lecture. These will mostly be scanned versions of my own notes, and will therefore contain some rough editing.

DateTeacherPlaceTopicLecture notes / comments
27.08.2008Truls Flatberg  B1036  Introduction, modeling.  [X] Chapter 2

Lecture note 1 

03.09.2008Truls Flatberg  B1036  OPL studio. Integer programming examples.  [X] Chapter 3

Lecture notes 2 

10.09.2008Truls Flatberg  B1036  Graph theory, spanning trees.  [D] 4.1 [S] 1.4

Lecture notes 3

Recommended exercises: [D] Prove Prop. 4.5 p.84 [S] 1.7, 1.11 

17.09.2008Truls Flatberg  B1036  Shortest paths.  [S] 1.1, 1.2 (self study), 1.3

Lecture notes 4

Exercises: 1.1, 1.2, 1.4 

24.09.2008Truls Flatberg  B1036  Convexity, polyhedra.  [S] 2.1 and 2.2

Lecture notes 5

Exercises: 2.2, 2.6 

01.10.2008Truls Flatberg  B1036  Linear programming.  [S] 2.3 and 2.4

Lecture notes 6 

08.10.2008Truls Flatberg  B1036  Bipartite matching.  [S] 3.1, 3.2, 3.3, 3.4, 3.6

Lecture notes 7 

15.10.2008Truls Flatberg  B1036  Network flow.  [S] 4.3, 4.4 (4.1 and 4.5 are self study)

Lecture notes 8 

22.10.2008Geir Dahl  B1036  Network flow.  [S] 4.6, 4.7 
29.10.2008Truls Flatberg  B1036  Matching.  [S] 5.4, 5.4

Lecture notes 10 

05.11.2008Truls Flatberg  B1036  Integer programming  [S] 8.1 [D] 5.1

Lecture notes 11 

12.11.2008Truls Flatberg  B1036  Unimodularity.  [S] 8.2, 8.3, 8.4

Lecture notes 12 

19.11.2008Truls Flatberg  B1036  Branch and bound.  [D] 6.3

Lecture notes 13 

26.11.2008Truls Flatberg  B1036  Cutting plane methods.  [D] 6.1, 6.2, 6.4

Lecture notes 14 

Published Aug. 14, 2008 1:52 PM - Last modified Nov. 26, 2008 2:39 PM
E-mail this page