Archive Notes
Search
Search
Dark mode
Light mode
Explorer
Home
❯
University
❯
Year 3
❯
Semester 2
❯
6CCS3OME Optimisation Methods
6CCS3OME Optimisation Methods
10 items under this folder.
Jun 18, 2026
1. Single-source shortest paths problem, relaxation technique, Bellman-Ford algorithm
Jun 18, 2026
2. Dijkstra's shortest-paths algorithm, shortest-paths algorithms for DAGs
Jun 18, 2026
3. All-pairs shortest paths, point-to-point shortest-paths in geographical networks
Jun 18, 2026
4. Network flow problems, maximum flow problem, Ford-Fulkerson method
Jun 18, 2026
5. Edmonds-Karp maximum-flow algorithm, Maximum bi-partite matching, Minimum flow
Jun 18, 2026
6. Minimum-cost flow problem, Multi-commodity flow problems
Jun 18, 2026
7. Linear programming, Introduction to numeric optimisation
Jun 18, 2026
8. Basic concepts in convexity, convex sets, convex functions, Convex optimisation
Jun 18, 2026
9. Gradient methods, stochastic optimisation
Jun 18, 2026
10. Constrained Optimisation