DATA 433
Essential Optimization
Unconstrained optimization and constrained optimization. Linear programing. Graph algorithms (including shortest-path and min-cut/max-flow) and integer programming. Simulated annealing and evolutionary algorithms. Other aspects of optimization as time permits. Prerequisite(s): Computer Science 217, Mathematics 267 and 311.
Sources
- Course catalogue ↗2026-2027