ISE/OR/MA766 Network Flows

ISE/OR/MA 766: Network Flows

Syllabus References

Lecture Notes

Lecture 1    |   Lecture 2     |   Lecture 3    |   Lecture 4

Lecture 5    |   Lecture 6     |   Lecture 7    |   Lecture 8

Lecture 9   

Supplementary Notes

Chapter 2   |   Chapter 3   |   Chapter 4   |   Chapter 5

Chapter 6   |   New result of the max flows problem in O(nm) time

Reading Material

  • Fast Algorithm for the Shortest Path
  • Lawler’s Stories
  • Jack Edmond’s Stories
  • Manufacturing_Network_Flow
  • Totally Unimodular Matrices
  • Different algorithms for the shortest path problem
  • Point-to-point connection problem

Homework

Assignment #1   |   Assignment #2    |  Assignment #3    |  Assignment #4

Assignment #5   |   Assignment #6    |  Assignment #7    |  Assignment #8

Project

  • Proposal:
  • Final report:

Exams

  • ISE/OR 766 Exam 1:
  • ISE/OR 766 Exam 2:

Grades

  • Exam 1

  • Exam 2