Advanced32 min
Combinatorial Optimisation and Hardness
Knapsack, TSP and set cover; NP-hardness, approximation ratios and when a greedy bound is provably good.
Assumes you know
Not yet written
This lesson is on the syllabus but has no text yet
The full curriculum is published up front so you can see the whole route and its dependencies. Lessons are being written in curriculum order.
What it will cover
- knapsack
- TSP
- NP-hard
- approximation ratio
- heuristic