302379 (v.2) Combinatorial Optimisation 402

---

 

Area:	Department of Mathematics and Statistics
Contact Hours:	3.0
Credits:	25.0
Lecture:	3 x 1 Hours Weekly
Graph theory - matchings, the Konig-Hall theorem on maximum matchings, The Hungarian method, The Kuhn-Munkes algorithm. Applications. Network flow theory. The minimum cost flow problem. Problems of transportation. Scheduling, production planning. Combinatorial optimisation - theorems of Hall.