Ma252 General Information

MA252
Term 2

Course Description

This module provides an introduction to combinatorial optimisation. Topics include linear programming and graph algorithms. See also the description in the Online handbook.

Lecturer

Name	Office	E-mail	Phone	Office Hour
Diane Maclagan	C2.26 Zeeman Building	D.Maclagan at warwick.ac.uk	(024) 7652 8333	Friday, 15:00

Course Times and Location

You are expected to attend all lectures.

What	Where	When
Lecture	MS.01	Monday 10:00
Lecture	H0.51	Wednesday 10:00
Lecture	H0.51	Friday 14:00

Recommended Texts

Combinatorial Optimization by W.J. Cook, William H. Cunningham, W. R. Pulleyblank, and A. Schrijver.
Introduction to linear optimization by Dimitris Bertsimias and John Tsitsiklis.

The first of these is more relevant for the first part of the module, and the second for the second part. Both are available on 3-day loan in the library.

Some other useful books include:

Combinatorial optimization : algorithms and complexity by Christos H. Papadimitriou, and Kenneth Steiglitz. Also on 3-day loan.
Combinatorial Optimization: Polyhedra and Efficiency (Algorithms and Combinatorics) by Schrijver (mostly beyond the scope of this module, but a fantastic general reference).
Combinatorial optimization : theory and algorithms by Bernhard Korte and Jens Vygen.

Announcements

Assessment

There will be homework assigned every two weeks, which will be posted on the schedule webpage. This page will also have the plan for the coming weeks. Homework will not be collected or directly assessed. It will be indirectly assessed in the sense that it will provide preparation for the examination.
Your final mark for this module will depend 100% on a two-hour examination in Term 3.