Search Results
ISE 766 Network Flows
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.
Prerequisite: OR(IE,MA) 505
Typically offered in Spring only
This course is offered alternate years