MA4525 - Combinatorial and Network Optimization | ||||||||||
| ||||||||||
| * 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 | ||||||||||
Detailed Course Information | ||||||||||
| MA4525.pdf | ||||||||||
Useful Links | ||||||||||
| Department of Mathematics | ||||||||||
