Optimal Pod Placement

In this section we pose the pod placement (assignment) problem as a minimum cost maximum flow problem. In the class we will go through this implementation to understand the algorithmic implementation of optimal pod placement aka the K8s scheduler algorithm.