Review of linear programming. Shortest path problems. The max-flow min-cut theorem and applications. Minimum cost flow problems. Network simplex and primal-dual algorithms. Applications to problems of transportation, distribution, job assignments and critical-path planning. [Offered: F,S] Prereq: One of CO 250/350 or 352 or 255/355 or CM 340. Not open to General Mathematics students
