The course will be taught in the form of 12 lectures of 90 minutes
each. The preliminary schedule is given below, giving
the relevant chapters from the textbook.

Lectures will be given on Tuesdays and Thursdays, 13.15-15.00, in Room
3721, Lindstedtsvägen 25, according to the schedule below.

Lecture 0 | Mar 14 | I.1 | The scope of integer and combinatorial optimization |
---|---|---|---|

I.2 | Linear programming | ||

I.4.1 | Polyhedral theory | ||

Lecture 1 | Mar 21 | I.4.2-8 | Polyhedral theory |

Lecture 2 | Mar 28 | I.5 | Computational complexity |

Lecture 3 | Mar 30 | I.6 | Polynomial-time algorithms for linear programming |

Lecture 4 | Apr 4 | II.1.1 | The theory of valid inequalities |

Lecture 5 | Apr 6 | II.2.1-2 | Strong valid inequalities for structured integer programs |

Lecture 6 | Apr 25 | II.3.1,6 | Duality and the value function |

Lecture 7 | Apr 27 | II.3.7 | Duality and the value function |

II.4.1-2 | General algorithms | ||

Lecture 8 | May 2 | II.5.1-2 | Special-purpose algorithms |

Lecture 9 | May 4 | II.5.3 | Special-purpose algorithms |

Lecture 10 | May 9 | II.5.4-5 | Special-purpose algorithms |

Lecture 11 | May 11 | II.6.1-2 | Applications of special-purpose algorithms |

Lecture 12 | May 16 | II.2.4 | Strong valid inequalities for structured integer programs |

II.6.4 | Applications of special-purpose algorithms | ||

5B5860 Integer programming - practical algorithms