|
You are here:
Macquarie
» 2006 Handbooks
» Units
» COMP323
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: |
COMP125(P) or COMP165(P); MATH136(P) or MATH133(P); MATH237(P)
|
| Corequisites: |
|
| NCCWs: |
|
| Unit Designations: |
Commerce; Economics
Science
| | Assessed As: |
Graded
|
| Offered By: |
Department of Computing |
|
|
|
|
