lecture11: multicommodity flow problems and Minoux's greedy method
The lecture introduces the concept of a greedy heuristic in
the form of Minoux's greedy method for solving the network design
problem.
Topics covered

- Notation recap
- A simplified problem
- Separable linear cost model
- Complete topology
- Problem formulation
- An aside
- Simplification
- Heuristic Methods
- Greedy Methods
- Minoux's Greedy Method
- Minoux's Greedy Method (cont)
- Minoux's Greedy Method
- Minoux's Method: Example 1
- Minoux's Method: Example 2 (i)
- Minoux's Method: Example 2 (ii)
- Minoux's Method: Example 2 (iii)
- Minoux's Method: Example 2 (iv)
- Minoux's Method: Example 2 (v)