ISE/OR/MA766 Network Flows

ISE/OR/MA 766: Network Flows

Syllabus References

Lecture Notes

Lecture1-2026 |   Lecture 2     |   Lecture 3    |   Lecture 4

Lecture 5    |   Lecture 6     |   Lecture 7    |   Lecture 8

Lecture 9    |   Soft Computing Methods

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

• Faster Algorithms for Shortest Path Problem
• Lawler’s Old Stories
• Jack Edmond’s Stories
• Manufacturing_Network
• Totally Unimodular Matrix
• 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

Project Requirement

• Project Presentation

     Due: TBD

• Final Project Report

     Due: 12:00 noon on December 3, 2026

In-class Quizzes/Exams 

• Date: TBD
• Room: 4141 Fitts-Woolard Hall
• Time: TBD

Grades

• Homework Assignments: 50% (6–8 assignments)
• In-class Quizzes/Exams: 30% (2-3 quizzes)
• Course Project: 20% (proposal, presentation, and final report)

 

Late Policy

• Late assignments and projects will be accepted with a 33% deduction per day after the deadline.