Level:
Graduate
Instructors:
Diagram showing a Breadth First Search in progress. (Diagram by Prof. James Orlin.)
Course Features
Course Highlights
Walk through the main topics in Network Optimization step-by-step by viewing the many
animations available. The complete set of
lecture notes makes
use of many diagrams and other visuals to clarify abstract concepts.
Students work by themselves or with a partner to complete
assignments, which sometimes involve proofs.
Course Description
15.082J/6.855J is an H-level 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, 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.
Technical Requirements
Special software is required to use some of the files in this course: .ppt.
*Some translations represent previous versions of courses.