Teaching plan

When referring to the curriculum the following abbreviations are used:

  • [D1]: G.Dahl, An introduction to convexity, Univ. of Oslo, 2009 (or 2004, some minor typos corrected).
  • [S] : A.Schrijver, A Course in Combinatorial Optimization, 2008.
  • [D2]: Dahl, Network flows and combinatorial matrix theory, Univ. of Oslo, 2009.

DateTeacherPlaceTopicLecture notes / comments
26.08.2009Geir Dahl (GD)? B1036? Introduction, convexity [D1]: 1 Basic concepts? Exercises: 1.3, 1.4, 1.5, 1.6, 1.7, 1.8, 1.9?
02.09.2009GD? B1036? Convexity [D1] 2 Convex hulls? Exercises: 1.11, 1.13, 1.14, 1.15, 1.16, 1.18, 1.19, 1.20, 1.21, 1.22, Project 1.2, Project 1.3?
09.09.2009GD? B1036? Convexity [D1] 3 Projection and separation? Exercises: 2.1, 2.2, 2.3, 2.5, 2.6, 2,7, 2.8, 2.9, 2.10, 2.13, 2.14, 2.16, 2.18, 2.20, 2.23, 2.24, 2.25, 2.262.30, 2.31, 2.37?
16.09.2009GD? B1036? Convexity [D1] 4 Representation of convex sets? Exercises: 3.2, 3.3, 3.5, 3.6, 3.7, 3.8, 3.10, 3.12, 3.13, 3.15, 3.16, 3.17, 3.19?
23.09.2009GD? B1036? Convexity [D1] 4 Representation of convex sets ? Exercises: 4.1, 4.2, 4.4, 4.5, 4.7, 4.8, 4.9, 4.10, 4.11, 4.14, 4.15?
30.09.2009GD? B1036? Network flows and combinatorial matrix theory. [D2] 1 Flows and circulations.? Exercises: 4.16, 4.17, 4.19, 4.21, 4.23, 4.25, 4.26, 4.27, 4.29, 4.30, 4.32, 4.33?
07.10.2009GD? B1036? Network flows and combinatorial matrix theory. [D2] 1 Max-flow min-cut ? Exercises from "Network flows...": 1, 2, 3, 4, 5, 6, 7, 8.?
14.10.2008Carlo Mannino (CM)? B1036? Combinatorial optimization: the CO concept, shortest path, spanning tree.? Exercises from "Network flows...": 9, 10, 11, 12.?
21.10.2009CM? B1036? Combinatorial optimization: zero-one LP formulations,? Exercises on shortest paths: see Notes from the lectures.?
28.10.2009CM? B1036? Combinatorial optimization: separation, dynamic simplex method? Exercises on polyhedral combinatorics: see Notes from the lectures.?
04.11.2009CM? B1036? Combinatorial optimization: totally unimodularity and integrality? Exercises on ...: see Notes from the lectures.?
11.11.2009CM? B1036? Combinatorial optimization: heuristic methods (greedy, local search)? Exercises on ...: see Notes from the lectures. ?
18.11.2009CM? B1036? Combinatorial optimization: exact methods? Exercises on ...: see Notes from the lectures. ?
25.11.2009GD? B1036? Summary, comments, examples.? ?
02.12.2009GD? B1036? Lecturer available for possible questions.? ?
Published June 5, 2009 12:53 PM - Last modified Nov. 23, 2009 1:23 PM