Network-Based Planning and Scheduling Systems

Catalog description

Credits 3. 3 Lecture Hours. Fundamental theory, mathematical modeling, and algorithms of network flow models including shortest path models maximum flow and cost minimization models; out-of-kilter algorithm; pure and generalized network specializations of the primal simplex method; introduction to multi-commodity networks. Prerequisite: ISEN 620 or 622.