MIT OpenCourseWare
Combinatorial Optimization
- Instructor
- Prof. Santosh Vempala
- Term
- Fall 2003
- Level
- Undergraduate
- What's inside
- 1 lecture note · 1 reading · 17 other files · 3 web pages
- Materials open
- MIT OCW
About this course
Source: MIT OpenCourseWare 18.433 Combinatorial Optimization, Fall 2003, Prof. Santosh Vempala — original course page on ocw.mit.edu ↗. License: CC BY-NC-SA 4.0. Study order: none is claimed; materials are grouped by MIT's own sections. Taken from MIT's published course files, downloaded from ocw.mit.edu on September 23, 2026. How RedLectern is built.
Materials are grouped the way MIT organized them. A verified, course-wide order has not been established here.
Before you start
Prerequisites are not listed here. Check MIT's own syllabus for this course.
How this course was organized
What's here, and what isn't
- MIT lists a session calendar for this course, but it could not be verified well enough to build a sequence from it — materials are grouped by section instead.
Not included here
1 item from the source could not be safely included:
- Referenced in a table, but without MIT's own verified order, so it isn't used to claim a sequence.
Materials by section
Grouped by section, as MIT organized them. Not sequenced or ordered.
Lecture Notes
13 files
- Matching Algorithms Download
- Polyhedral Combinatorics Download
- The Matching Polytope: Bipartite Graphs Download
- The Matching Polytope: General Graphs Download
- Flow Duality and Algorithms Download
- Minimum Cuts Download
- Linear Programs Download
- The Simplex Algorithm Download
- The Primal-dual Algorithm Download
- The Ellipsoid Algorithm Download
- Separation Oracles Download
- NP-completeness Download
- Approximation Algorithms Download
Assignments
MIT OpenCourseWare, Prof. Santosh Vempala, 18.433 Combinatorial Optimization, Fall 2003.
License: CC BY-NC-SA 4.0 · Edition: Fall 2003 · Open the original course on OCW ↗
Organized by RedLectern, independent of MIT and not endorsed by MIT.
Per-resource rights are recorded on each resource; All-Rights-Reserved items are link-only, never mirrored.
