18.4531
Combinatorial Optimization
Thorough treatment of linear programming and combinatorial optimization. Topics include matching theory, network flow, matroid optimization, and how to deal with NP-hard optimization problems. Prior exposure to discrete mathematics (such as 18.200 ) helpful. Students in Course 18 must register for the undergraduate version, 18.453 .
Prerequisites & course information
Subject meets with 18.453 Prereq: 18.06 , 18.700 , or 18.701 Acad Year 2027-2028: G (Spring) Acad Year 2028-2029: Not offered 3-0-9 units
Sources
- Course catalogue ↗2026–2027