Note: the dates are not updated!! 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.(Kap.1)
- [D2]: Dahl, Network flows and combinatorial matrix theory, Univ. of Oslo, 2009.
- [DM]: Dahl, Mannino, Notes on combinatorial optimization, Univ. of Oslo, 2009.
| Date | Teacher | Place | Topic | Lecture notes / comments |
| 01.09.2010 | Geir Dahl (GD) | B1036 | Introduction, convexity [D1]: 1 Basic concepts | Exercises: 1.3, 1.4, 1.5, 1.6, 1.7, 1.8, 1.9 |
| 08.09.2010 | GD | 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.2010 | GD | B1036 Note: Thursday 9., 14.15-16 | 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 |
| 15.09.2010 | GD | 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 |
| 22.09.2010 | GD | B1000 (meeting room) | 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 |
| 29.09.2010 | Carlo Mannino (CM) | B1036 | Combinatorial optimization: the CO concept, shortest path, spanning tree. | Exercises from Convexity: 4.17, 4.19, 4.20, 4.21, 4.23, 4.24, 4.25, 4.26, 4.28, 4.29. Exercises from "Network flows...": 9, 10, 11, 12. Lecture notes |
| 06.10.2010 | CM | B1036 | Network flows and combinatorial matrix theory. [D2] 1 Flows and circulations. | Lecture notes |
| 13.10.2010 | CM | B1036 | Network flows and combinatorial matrix theory. [D2] 1 Max-flow min-cut | Lecture notes The first part of the second assignment will be introduced.Second Assignment (part 1) |
| 20.10.2010 | CM | B1036 | Combinatorial optimization: zero-one LP formulations, | Lecture notes Exercises on polyhedral combinatorics: see Notes from the lectures. |
| 21.10.2010 | CM+GD | B1036, NB, NB: torsdag kl 09.15 - 10 | Introduction to the OPL-CPLEX optimization system | Lecture notes |
| 27.10.2010 | CM | B1036 | Combinatorial optimization: separation, dynamic simplex method | Lecture notes |
| 03.11.2010 | GD | B1036 | Combinatorial optimization: totally unimodularity and integrality | See Chapter 2 in Notes on Comb.Opt.: Section 2.1: brief knowledge, Sections 2.2 and 2.3: everything covered. |
| 10.11.2010 | CM | B1036 | Combinatorial optimization: heuristic methods (greedy, local search) | Lecture notes . |
| 17.11.2010 | CM | B1036 | Combinatorial optimization: exact methods | Lecture notes |
| 24.11.2010 | GD | B1036 | Summary, comments, examples. | |
| 29.11.2010 | GD, CM | B1036 | Lecturer available for possible questions. |