2009 Course Handbook
COMP323: Optimisation
This unit concentrates on combinatorial optimisation. Topics included are: linear programming, the simplex algorithm (theory, implementation and use in modelling), duality, algorithms and complexity (with examples from flow, matching and spanning-tree problems), NP completeness and intractable problems. Practical work will include the implementation of a number of algorithms.
| Credit Points: | 3 |
| Contact Hours: | -- |
| When Offered: | D1 - Day; Offered in the first half-year |
| Staff Contact: | Computing Staff |
| Prerequisites: | 40cp and (COMP125(P) or COMP165(P)) and MATH237(P) |
| Corequisites: | |
| NCCWs: | |
| Unit Designations: |
Commerce; Economics
Science |
| Assessed As: | Graded |
| Offered By: |
Department of Computing |
Timetable Information
For unit timetable information please visit the Timetables@Macquarie Website.