Course Description
Study of problems of flows in networks. These problems include the determination of shortest chain, maximal flow and minimal cost flow in networks. Relationship between network flows and linear programming developed as well as problems with nonlinear cost functions, multi-commodity flows and problem of network synthesis.
Spring 2024
Instructors
Meeting Patterns
Classes Start:
January 8, 2024
Classes End:
April 23, 2024
Location:
04141 Fitts-Woolard Hall
Class Days:
T H
Class Start Time:
11:45am
Class End Time:
1:00pm
Class Type:
Lecture
Credits:
3.00
Restrictions:
Prerequisite: OR(IE,MA) 505
