Network Optimization (Math 466/566)

Math 466/566:  Network Optimization

Course Overview
Welcome to Network Optimization! We will present an integrated view of the theory, algorithms, and the applications of key network optimization problems including the shortest path problem, the maximum flow problem, the minimum cost flow problem, the minimum spanning tree problem, and matching problems. Most of the arguments will be presented from first principles, and we will adopt a network or graphical view point. Previous knowledge of linear optimization will not be required. We will emphasize powerful algorithm strategies, rigorous analysis of the algorithms, and data structures for their implementation. Apart from problems involving proofs (in homework and the midterm exam), the student will be produce implementations of some of the algorithms (using Matlab; or Python or a similar package/language).

Syllabus and Schedule  


Thu, Aug 18: Pullman classroom is moved to Cleveland 30
Thu, Sep 01: Extra check-in hours today 12–1 and 5–6 PM
Mon, Sep 12: This week's lectures (Sep 13, 15) will originate in Pullman.
Tue, Sep 20: Today's check-in hour will be from 12:30–1:30 PM.
Mon, Nov 14: No regular lectures this week (Nov 15, 17). Videos have been posted.

Submit feedback!   (do it anonymously, at any time)

Last modified: Mon Nov 14 20:44:12 PST 2022