Disc. Optimization·Course
Discrete Optimization
Discrete optimization: integer programming, branch and bound, network flows, metaheuristics, and approximation algorithms
Part of the Mathematics track — finish it for a verifiable diploma →
§ 01 — Orientation
New here?
What you'll be able to do, who this is for, how long it takes, and where to begin.
By the end, you will be able to
- 01Formulate integer-programming problems.
- 02Solve network and flow problems.
- 03Apply metaheuristics to hard problems.
- 04Match a method to a real optimization task.
- 05Recognize what's tractable and what isn't.
Who this is for
How long it takes
- Quick orientationSkim the opening module and the cheatsheet to get the shape of it.~1 h
- Full read-throughRead every article once, in order.~1 h
- Mastery pathRead, take the quizzes, and space out your reviews.~2 weeks
- APA
Stoa. (2026). Discrete Optimization [Online course]. Stoa. https://stoa.school/course/discrete-optimization
- MLA
Stoa. “Discrete Optimization.” Stoa, 2026, https://stoa.school/course/discrete-optimization.
- Chicago
Stoa. “Discrete Optimization.” Stoa. Accessed September 1, 2026. https://stoa.school/course/discrete-optimization.
§ 02 — Curriculum
4 modules.
Each module is a small unit. Most read in sequence — but a determined reader can begin anywhere.
- M IFundamentals of Discrete Optimization and CombinatoricsIntroduction to discrete optimization, classical problems, and complexity theory3 articles
18 minBegin → - M IIBranch-and-Bound MethodsBranch-and-Bound, Branch-and-Cut, and their applications in MILP3 articles
18 minBegin → - M IIIApproximation AlgorithmsApproximation theory, greedy algorithms, and PTAS3 articles
18 minBegin → - M IVMetaheuristicsSimulated annealing, genetic algorithms, and local search3 articles
18 minBegin →
§ 03 — Learning outcomes
4 outcomes.
Formulate problems as integer linear programs and apply LP relaxation and branch-and-bound methods
Solve maximum flow, shortest path, and matching problems
Apply simulated annealing, genetic algorithms, and tabu search
Solve practical routing, scheduling, and resource allocation problems
§ 04 — Practices