Formulation and solution of network optimization problems including shortest path, maximal flow, minimum cost flow, assignment, covering, postman, and salesman. Credit not granted for both MATH 466 and MATH 566. Required preparation must include linear programming. Class Notes: Online delivery with at least one opportunity each week for students to interact synchronously with the instructor at the original time identified above. The Instructor will define the synchronous interaction.
Credit not granted for both 400 and 500 level.
Cooperative: Open to UI degree-seeking students.
VC Originating in Pullman