Mar 20, 2019  
2018-2019 Undergraduate Catalog 
    
2018-2019 Undergraduate Catalog
[Add to Favorites]

MATH 5490 - Network Flows


Every other year. Begins with the classical min-cost flow problem, defined on an ordinary network. Other problems, such as shortest path, are also shown in this class. Both theory and algorithms are presented. Extensions include generalized networks, nonlinear costs, fixed charges, multi-commodity flows and additional applications, such as in communications networks. Prereq: Graduate standing in Applied Mathematics or permission of the instructor. Max hours: 3 Credits. Semester Hours: 3 to 3



[Add to Favorites]