We will attempt to cover as many of the following topics as possible.
Network flow problems and applications; matrices; paths, trees and cycles; equivalent networks and transformations; combinatorial issues; algorithm design and complexity analysis; shortest paths, label setting algorithms, label-correcting algorithms; maximum flows, polynomial algorithms and special applications; minimum cost flows, polynomial algorithms, network simplex algorithms; assignments and matchings; minimum spanning trees; convex cost flows.

The concepts developed in this course will help the students to create mathematical models for the solution of problems which can be analyzed by the methods of network flows.

There will be a mid-term, a final examination, and several homework assignments.  All the assignments will be discussed in class.  The grading will be relative or “on the curve”, i.e., the performance of a student relative to the class will be important.

The material up to and including the topic “algorithm design and complexity analysis” will be covered before the mid-term.  The final examination will be based on the entire course material, however greater emphasis will be laid on the material covered after the mid-term. (The calendar of events will  be included at the beginning of the relevant semester.)

Text- Network flows, R. K. Ahuja, T. L. Magnanti and J. B. Orlin, Prentice Hall, 1993.

Any students with disabilities, or other special needs, who need special accommodations in this course are invited to share these concerns or requests with the instructor as soon as possible.

All work in this course must be completed in a manner consistent with NDSU University Senate Policy, Section 335: Code of Academic Responsibility and Conduct (http://www.ndsu.nodak.edu/policy/335.htm).