MA 446 - Combinatorial Optimization
- Credit Hours: 4R-0L-4C
- Term Available: S (even years)
- Graduate Studies Eligible: No
- Prerequisites: MA 375
- Corequisites: None
An introduction to graph- and network-based optimization models, including spanning trees, network flow, and matching problems. Focus is on the development of both models for real-world applications and algorithms for their solution.