There will be two obligatory projects. The dates for these projects will be scheduled soon (at least for the first one).

The projects must be handed in no later than May 21st at noon.

The data is listed in the following format:

- n=26; the number of vertices
- Edges ={edge1,edge2,...,edgem};

- Weekly note 1
- Weekly note 2
- Weekly note 3
- Weekly note 4
- Weekly note 5
- Weekly note 6
- Weekly note 7
- Weekly note 8
- Weekly note 9
- Weekly note 10
- Weekly note 11
- Weekly note 12

This is the software we shall use during the course. We have one license of the full version (I will give instructions on how to use that next week). Besides this you should all download the free trial version of OPL studio 3.7.1 (not the higher version!). You do so by going to the URL http://www.ilog.com/products/oplstudio/trial.cfm and register. Now you should be able to download OPL studio 3.7.1.

If it does not work you can find the instalation kit for Windows as an .exe file here

- Slides from Lecture 1 in PDF
- More slides from Lecture 1 in PDF
- Some notation
- slides from lecture 2 in PDF
- slides from lecture 2 in PDF
- Notes on linear programming in PDF
- Notes om duality in PDF
- Slides on shortest paths
- Slides on total unimodularity
- Slides on projectplanning
- Maximum (s,t)-flows
- Preflow push
- Min cost flow
- Slides on LP based Branch and Bound
- Slides on B&B
- Slides on Gomory cuts
- Slides on cutting planes
- Branch and bound for STSP using !-trees
- Branch and cut for STSP
- Slides on Lagrange relaxation
- Solutions to exercises 8.5, 8.8 and 8.15 by Jesper Larsen, IMM, DTU
- Solutions to exercises from Chapter 10 by Jesper Larsen, IMM, DTU

- Set covering setcover.mod, setcover.dat, setcover.prj
- Uncapacitated Facility Location UFL.mod, UFL.dat, UFL.prj
- N queens Nqueens.mod, Nqueens.dat, Nqueens.prj
- Graf partitioning gp.mod, gp.dat, graf50, gp.prj
- Capacitated lotsizing CLS.mod, CLS.dat, CLS.prj
- Exercise 2.8.9 exercise289.mod, exercise289.prj
- Hamiltonian cycle for two graphexamples ham.mod,pham.mod
- Minimum weight 2-edgeconnected spanning subgraph ec.mod
- Solving minimum spanning tree using OPL script mst.mod, mst.osc,gr17.dat, gr6.dat

- A python program for generating all subsets of a set set.py

- Notes on Branch and Bound in PDF format
- John Beasleys OR notes with many examples and motivations.

Last modified: Fri Apr 27 14:26:45 CEST 2007 Joergen Bang-Jensen (jbj@imada.sdu.dk)