Courses:

Network Optimization >> Content Detail



Calendar / Schedule



Calendar

Amazon logo When you click the Amazon logo to the left of any citation and purchase the book (or other media) from Amazon.com, MIT OpenCourseWare will receive up to 10% of this purchase and any other purchases you make during that visit. This will not increase the cost of your purchase. Links provided are to the US Amazon site, but you can also support OCW through Amazon sites in other regions. Learn more.

The required text is: Amazon logo Ahuja, Magnanti, and Orlin. Network Flows: Theory, Algorithms, and Applications. 1st ed. Upper Saddle River, NJ: Prentice Hall, February 18, 1993. ISBN: 013617549X. "AMO Reading" refers to this text.


SES #TOPICSREADINGS IN AMO
1Introduction to Network Models1-22, 53-63
2Computational Complexity and Data Structures23-38, 765-773
3Graph Search Algorithms38-47, 66-79
4Transformations and Flow Decomposition79-86
5Shortest Paths: Label Setting Algorithms93-114
6The Radix Heap Algorithm115-124
7Shortest Paths: Label Correcting Algorithms133-147, 149-150, 154-157
8Basic Algorithms for The Maximum Flow Problem166-187
9Combinatorial Applications of Maximum Flows188-198 and 207-223
10Preflow Push Algorithms223-237
11More on Preflow Push Algorithms238-242
12Midterm
13The Global Min Cut AlgorithmClass Handout
14Minimum Cost Flows: Basic Algorithms294-319
15The Successive Shortest Path Algorithm320-326
16The Network Simplex Algorithm402-453
17Minimum Cost Spanning Trees510-536
18Review of Linear Programming802-820
19Generalized Flows566-592
20Lagrangian Relaxation 1598-615
21Lagrangian Relaxation 2615-638
22Multicommodity Flows649-671
23Multicommodity Flows671-683
24Very Large Scale Neighborhood SearchClass Handout

 








© 2010-2021 OpenCollege.com, All Rights Reserved.
Open College is a service mark of AmeriCareers LLC.