Announcements:  Final Assignment Due Monday, Dec. 10

Meetings:          MW, 9AM in Smith 211

Instructor:            Scott Provan
           office:         Smith 204
           telephone:   962-3836
          e-mail:         Scott_Provan@UNC.edu

Office Hours:   Tuesday 1-3PM

Web page: http://stat-or.unc.edu/webspace/courses/provan/STOR724_web

Text:          Network Flows: Theory, Algorithms, and Complexity
                                    by R.K. Ahuja, T.L. Magnanti, and J.P. Orlin

Software: NETSOLVE (more later)

                        Midterm                          35%
                        Final                                50%
                        Homeworks                     15%

Lectures (subject to modification):

Lecture 1:  An Introduction to Networks and Their Uses
Lecture 2:  An Introduction to Algorithms and Complexity
Lecture 3:  Graph Search Techniques
Lecture 4:  The Shortest Path Problem: Examples and Basic Algorithms
Lecture 5:  Using Data Structures to Improve Dijkstra's Algorithm
Lecture 6:  Shortest Paths in Acyclic Graphs & PERT Scheduling
Lecture 7:  Shortest Paths in Graphs with Negative Arc Lengths
Lecture 8:  Introduction to Maximum Flows
Lecture 9: The Ford-Fulkerson Routine for Finding Max Flows
Lecture 10: Polynomial Time Algorithms for Max Flow
Lecture 11:Applications of Min Cost Flows
Lecture 12:Basic Algorithms for Min Cost Flow
Lecture 13:Polynomial Algorithms for Min Cost Flow
Lecture 14:Linear Programming and the Simplex Method
Lecture 15: The Network Simplex Method
Lecture 16: Primal Dual Methods for Network Problems
Lecture 17: Matching Problems
Lecture 18: Minimum Spanning Tree Problems
Lecture 19: NP-Complete Problems
Lecture 20: Steiner Tree Problems
Lecture 21: Two Applications in Biology