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 math or computer science. Semester Hours: 3 to 3