Courses > Mathematics > Combinatorial Optimization Combinatorial Optimization provides a thorough treatment of linear
Courses > Mathematics > Combinatorial Optimization 18.433 Combinatorial OptimizationFall 2003
One cycle of the ellipsoid algorithm. (Image by Prof. Santosh Vempala.)
Course HighlightsThis course includes a full set of lecture notes, plus problems sets.
Course DescriptionCombinatorial Optimization provides a thorough treatment of linear programming and combinatorial optimization. Topics include network flow, matching theory, matroid optimization, and approximation algorithms for NP-hard problems.
*Some translations represent previous versions of courses. Courses > Mathematics > Combinatorial Optimization Download this Course18-433Fall-2003.zip (ZIP - 1.22 MB) Click the link above to start downloading this course. You may need to download file decompression software such as WinZip or StuffIt to open the .ZIP file. For more information about downloading and using zipped courses, read our Frequently Asked Questions. All of the Materials included in the .ZIP file are governed by the same Creative Commons license that governs use of materials published on the MIT OCW page. |

See all the reviews