The aim of the course is to introduce students to graph theory and combinatory optimistaion:
| On completion of the unit, the student will be capable of: | Classification level | Priority |
|---|---|---|
| Acquiring the basic notions of graph theory and optimisation | 1. Knowledge | Essential |
| Understanding and applying classic resolution methods in discrete optimisation | 3. Apply | Essential |
| Percentage ratio of individual assessment | Percentage ratio of group assessment | ||||
|---|---|---|---|---|---|
| Written exam: | 100 | % | Project submission: | % | |
| Individual oral exam: | % | Group presentation: | % | ||
| Individual presentation: | % | Group practical exercise: | % | ||
| Individual practical exercise: | % | Group report: | % | ||
| Individual report: | % | ||||
| Other(s): % | |||||
| Type of teaching activity | Content, sequencing and organisation |
|---|---|
| Course | Introduction to graph theory |
| Course | Tree spanning minimum weight problem, shortest path problem |
| Course | Introduction to linear programming in whole numbers: modelling, simplex, branch-and-bound |
| Supervised study | Supervised study on 1st course session topic |
| Supervised study | Supervised study on 2nd course session topic |
| Supervised study | Supervised study on 3rd course session topic |
| Course | Back-pack problem |
| Course | Sales representative problem |
| Course | Problem of vehicle rounds |