Discrete Optimization

4 credits

Maximization and minimization problems in graphs and networks (shortest paths, minimum spanning trees, maximum flows, minimum cost flows); transportation and trans-shipment problems, NP-completeness. Prerequisite: a minimum grade of 2.0 in MATH 407; and a minimum grade of 2.0 in either MATH 300 or MATH 334. Offered: Sp.