Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
This lecture covers the complementarity slackness for the transhipment problem, optimality conditions, and proofs related to network paths, labels, and costs. It also discusses negative cost cycles and the concept of simple paths.