Courses Handbook 2007 - [ Archived ]

302379 (v.2) Combinatorial Optimisation 402


Area:

Department of Mathematics and Statistics

Credits:

25.0

Contact Hours:

3.0
 
** 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. **
 

Lecture:

3 x 1 Hours Weekly
 

Syllabus:

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.
 
** 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. **
 

Field of Education:

010101 Mathematics

Funding Cluster:

04 - Mathematics, Statistics

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.

 
Curtin Search Curtin Site Index