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 |
| Matching and Processor Scheduling: Hungarian Method, Edmond's Algorithm. 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 optimization. Integral Polyhedra. Totally unimodular matrices, Network matrices, Balanced matrices and their applications. |
| Year | Location | Period | Internal | Area External | Central External | | 2003 | Bentley Campus | Semester 2 | Y | | | |
Current as of: October 30, 2003 13:11:55
CRICOS provider code 00301J
