IE 604 - Network Flow Optimization

3 Credit Hours

Fundamental theory, algorithms, and applications of deterministic network-flow models, and analytical procedures for a special class of stochastic networks (GERT networks). Linear programming and its relationship to network analysis. Algorithms for various kinds of shortest and k-shortest path models. Labeling procedures for maximal flows in capacitated networks. The Out-Of-Kilter algorithm for cost minimization flow models. Primal Simplex network optimization procedures for pure and generalized networks. Traveling-Salesman problem algorithms with extensions to multiple salesmen. CPM, PERT and network-flow models in project management. Introduction to multi-commodity networks. Extensive use of network optimization software.
(DE) Prerequisite(s): 522.
Registration Restriction(s): Minimum student level – graduate.

Print this Page

Undergraduates

Graduate Students

IE 604 - Network Flow Optimization