This page contains the course materials for Network Flows and Graphs, OA4202.

The sidebar contains the class calendar. The calendar simply lists relevant dates for exams and homework assignments.

You are also invited to read the class syllabus.

Here, we list the lecture contents.

- Introduction. Describing graphs mathematically. Storing graphs in a computer.
- Storing graphs in a computer. Definitions on graph structure. Breadth First Search.
- Go over homework 0. Properties of breadth first search. Depth first search.
- Properties of depth first search. Identifying a cycle. Topological sort. Strongly connected component.
- Go over homework 1. Development of Dijkstra's algorithm.
- Properties of Dijkstra's algorithm. A* search. Shortest path in directed acyclic graphs.
- Bellman-Ford algorithm for shortest path with negative edge lengths. Shortest path as an LP.
- Exam 0
- Go over HW2. Introduce HW3.
- Shortest path as an LP. Interdicting shortest paths: going from a max min to a max max.
- Interdicting shortest paths: row generation algorithm. Floyd-Warshall for all pairs shortest paths.
- Introduction to Max Flow. Dual of Max Flow and Max Flow Min Cut theorem. Ford-Fulkerson algorithm.
- Determining optimal primal/dual variables from Ford-Fulkerson. Ford-Fulkerson run time analysis.
- Capacity Scaling algorithm and analysis. Producer/Consumer max flow. Max flow with lower bounds.
- Minimizing number of ships to satisfy a schedule. Network reliability and edge/node disjoint paths.
- Job selection to maximize profit. Intro to minimum cost flow. Network transformations.
- Applications of minimum cost flow. Production planning and transportation. Matching.
- Network transformations. Successive shortest path algorithm.
- Go over HW 5. Modeling using minimum cost flows.
- Examples.

- Homework 0. Introduction to graphs. Storing graphs in a computer.
- Homework 1. Breadth-first search. Depth-first search. Applications of search like "reachability" and "topological sort."
- Homework 2. Shortest paths problems.
- Homework 3.1. Modeling shortest paths. Accompanying files.
- Homework 3.2. Interdicting shortest paths. Accompanying files.
- Homework 3.3. Interdicting max reliability paths.
- Homework 4. Maximum flow problems.
- Homework 5. Minimum cost flow problems.

These are some hand written notes on the lecture material:

- Notes 1. Introduction to graphs.
- Describing graphs mathematically.
- Storing graphs in the computer.

- Notes 2. Search algorithms.
- Definitions on graph structure.
- Breadth first search.
- Depth first search.
- Identifying a cycle.
- Topological sort.
- Finding strongly connected component.

- Notes 3. Shortest path algorithms.
- Dijkstra's algorithm
- A* search
- Directed acyclic graph shortest path
- Bellman-Ford algorithm

- Notes 4. Shortest path as an LP. Interdicting shortest path.
- Notes 5. All pairs shortest paths. Floyd Warshall.
- Notes 6. Maximum flow.
- Notes 6.1. Addendum to notes 6, two more maximum flow applications.
- Notes 7. Minimum cost flow.
- Notes 7.1. Successive Shortest Path algorithm.

**This is a completed course.**