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 PYDC
booklet.
|
Lecturer
Name |
Office |
E-mail |
Phone |
Office Hour |
Diane Maclagan |
B1.35 Zeeman Building |
D.Maclagan at warwick.ac.uk |
(024) 7652 8333 |
Mon 15:00 |
|
|
Course Times and Location
You are expected to attend all lectures.
What |
Where |
When |
Lecture |
L5 |
Tuesday 16:00 |
Lecture |
L4 |
Thursday 13:00 |
Lecture |
L4 |
Friday 14:00 |
|
|
Recommended Texts
In order of difficulty (the first being closest to this module, and the last being mostly beyond its scope):
Lecture notes by Schrijver.
Combinatorial Optimization
by W.J. Cook, William H. Cunningham W. R. Pulleyblank A. Schrijver.
Combinatorial Optimization: Polyhedra and Efficiency (Algorithms and
Combinatorics) by Schrijver.
|
Announcements
The handout with the algorithm for Max-Flow/Min-Cut is available here.
|
Assessment
There will be homework assigned every two weeks, which will be posted
on the schedule
webpage, which 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.
|