Area: |
Department of Mathematics and Statistics |
Credits: |
25.0 |
Contact Hours: |
4.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: |
1 x 3 Hours Weekly |
Tutorial: |
1 x 1 Hours Weekly |
Prerequisite(s): |
8140 (v.5) Operations Research 201 or any previous version
|
| |
Syllabus: |
Basic definitions and applications of graph theory to network design and analysis, scheduling, facility layout design and various allocation problems. Basic concepts of network flows - Max-Flow Min-Cut Theorem, feasible flows and algorithms. Algorithm for maximum matchings in bipartite graphs. Project and planning; CPM and PERT, resource allocation problems and time constraints. |
| |
| ** 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: |
10100 Mathematical Sciences (Narrow Grouping) |
HECS Band (if applicable): |
2 |
|
Extent to which this unit or thesis
utilises online information: |
Not Online |
Result Type: |
Grade/Mark |
|
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 |
|
