6122 (v.6) Combinatorial Optimisation 502
Note
Tutition Patterns
The tuition pattern below provides details of the types of classes and their duration. This is to be used as a guide only. For more precise information please check your unit outline.
Unit references, texts and outcomes
To ensure that the most up-to-date information about unit references, texts and outcomes appears, they will be provided in your unit outline prior to commencement.
| Area: | Department of Mathematics and Statistics |
|---|---|
| Credits: | 25.0 |
| Contact Hours: | 3.0 |
| Lecture: | 3 x 1 Hours Weekly |
| Syllabus: | Matching and processor scheduling. Hungarian method, Edmond's Aagorithm. Network flow theory. Minimum cost flow problem and an algorithm, project cost curve: an application in project management. Combinatorial optimisation. Lagrangian relaxation, Bender's decomposition, subgradient optimisation. Integral polyhedra. Totally unimodular matrices, network matrices, balanced matrices and their applications. |
| Field of Education: | 010101 Mathematics |
| SOLT (Online) Definitions*: | Not Online *Extent to which this unit or thesis utilises online information |
| Result Type: | Grade/Mark |
Availability
Availability Information has not been provided by the respective School or Area. Prospective students should contact the School or Area listed above for further information.
