Network Optimization
MIT Learn · advanced
15.082J/6.855J/ESD.78J is a graduate subject in the theory and practice of network flows and its extensions. Network flow problems form a subclass of linear programming problems with applications to transportation, logistics, manufacturing, computer science, project management, and finance, as well as a number of other domains. This subject will survey some of the applications of network flows and focus on key special cases of network flow problems including the following: the shortest path problem, the maximum flow problem, the minimum cost flow problem, and the multi-commodity flow problem. We will also consider other extensions of network flow problems.
Skills covered
Disclaimer
Suggestions only — review each course yourself to judge whether it meets the role's requirements. Completing a course doesn't guarantee proficiency or that you'll qualify; hiring standards vary by employer.
We may earn a commission through some course links.