Network Optimization (Fall 2015)

This website contains handouts, lecture notes, and other helpful material for the ORI 391Q course, a course focusing on Network Optimization, whose official title is "Network Flow Programming".

You are invited to read the class syllabus.

Lecture Videos

View or download an entire class worth of lectures from the Networks lecture videos page.  The course this year will have large sections of overlap with this material.

Board PDFs

Lecture1.pdf Lecture2.pdf Lecture3.pdf Lecture4.pdf Lecture5.pdf Lecture6.pdf Lecture7.pdf Lecture8.pdf Lecture9.pdf Lecture10.pdf Lecture11.pdf Lecture12.pdf Lecture13.pdf Lecture14.pdf Lecture15.pdf Lecture16.pdf Lecture17.pdf Lecture18.pdf

Homeworks

Look for assignment due dates on the calendar on the right.

Notes

  • Notes 1 -- Review big-Oh, data structures, graph terminology, storing graphs in a computer.
  • Notes 2 -- Intro to shortest path as an LP, graph search (BFS, DFS), applications of search.
  • Notes 3 -- Shortest path algorithms.
  • Notes 3.1 -- Overview of network models.
  • Notes 4 -- Interdicting shortest paths.
  • Notes 5 -- Maximum flow.
  • Notes 5.1 -- Interdicting max flow.
  • Notes 6 -- Minimum cost flow.
  • Nodes 7 -- Multi-commodity flow.
  • Notes 8 -- Constrained shortest path.
  • Notes 9 -- Network simplex algorithm.

© Copyright 2004-2017 - Ned Dimitrov