|
| |
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. |
Availability
| Year | Location | Period | Internal | Area External | Central External | | 2004 | Bentley Campus | Semester 2 | Y | | |
Area
External | refers to external course/units run by the School or Department, offered online or through Web CT, or offered by research. |
Central
External | refers to external course/units run through the Curtin Bentley-based Distance Education Area |
|
Click here for a printable version of this page
|
|
|
|
