6122 (v.5) Combinatorial Optimisation 502

---

 

Area:	Department of Mathematics and Statistics
Contact Hours:	3.0
Credits:	25.0
Lecture:	3 x 1 Hours Weekly
Prerequisite(s):	6121 (v.5) Advanced Optimisation Techniques 501 or any previous version
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.