How do you optimally bomb the Soviet rail network? | Max Flow (Ford-Fulkerson)
Автор: OptWhiz
Загружено: 2022-11-20
Просмотров: 2968
The maximum flow problem originated from the US Air Force during the Cold War. The US military at the time wanted to understand the rate at which the Soviet Union could send reinforcements to Eastern Europe.
This problem is now a classic in computer science and optimization. We first define what a flow is and why a greedy algorithm doesn't work. Next, we talk about the residual graph and the Ford-Fulkerson algorithm, which is the first algorithm invented to solve the maximum flow problem.
A paper on the history of the max flow problem:
https://homepages.cwi.nl/~lex/files/h...
Timestamps:
0:00 Introduction and History
2:05 Graph Formulation
3:45 Greedy Solution
4:58 Flow Definition
6:40 Flow Conservation
9:12 Residual Graph
11:17 Ford Fulkerson Algorithm
Доступные форматы для скачивания:
Скачать видео mp4
-
Информация по загрузке:
