Visit this resource

Title : 15.082J Network Optimization (MIT)

Description : 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.

Fromsemester : Fall

Fromyear : 2010

Creator :

Date : 2011-03-03T08:29:07+05:00

Relation : 15.082J

Relation : 6.855J

Relation : ESD.78J

Language : en-US

Subject : 15.082

Subject : 6.855

Subject : ESD.78

Subject : network models

Subject : network design

Subject : maximum flow algorithm

Subject : minimum cost flow

Subject : shortest path algorithm

Subject : algorithm efficiency

Subject : preflow push algorithm

Subject : data structures

Publisher : MIT OpenCourseWare

License : Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see