IE 512 - Graphs and Networks
Industrial Engineering, Penn State University

Graph and network theory; application to problems of flows in networks, transportation and assignment problems, PERT/CPM, postman problem and TSP.

Text: Linear Programming and Network Flows, 3rd Edition, by M.S. Bazaraa, J.J. Jarvis, & H.D. Sherali, Wiley, 2005

Prerequisites: IE 405 - Linear Programming

Course Topics:
Graph and Network Terminology
Tree Algorithms
Network Flow Problems
Linear Transportation Problem
Linear Assignment Problem
Out of Kilter Algorithm
Max Flow Problem
Shortest Path Problem
Project Networks
Matching and Covering Problems
Postman Problem
Traveling Salesman Problem

  Tom Cavalier's Homepage Tom Cavalier's Optimization Links
  Tom Cavalier's Selected Publications Penn State IE Homepage

Last modified: July 18, 2005