Skip to navigation
Skip to content
COURSES >>>


MA4525 - Combinatorial and Network Optimization

Offering Academic Unit
Department of Mathematics
Credit Units
3
Course Duration
One Semester
Pre-requisite(s)
Course Offering Term*:
Not offering in current academic year

* The offering term is subject to change without prior notice
 
Course Aims

This course introduces basic concepts of graph theory, methods of combinatorial and network optimization, coding theory for network optimization to minimize the error. It also helps students apply combinatorial techniques to solve a range of application problems in optimization, graph and network modeling.


Assessment (Indicative only, please check the detailed course information)
Continuous Assessment: 30%
Examination: 70%
Examination Duration: 3 hours
Min. Examination Passing Requirement: 30%
 

30% Coursework 70% Examination (Duration: 3 hours, at the end of the semester) For a student to pass the course, at least 30% of the maximum mark for the examination must be obtained.

 
Detailed Course Information
MA4525.pdf