Combinatorial Optimization OpenCourseWare: A Free Undergraduate Course on Linear Programming and Combinatorial Optimization by MIT

Published Feb 28, 2009

RSS Feed

'Combinatorial Optimization' is an OpenCourseWare that focuses on linear programming, randomization and flow theory. Students will learn to develop combinatorial algorithms with practical applications. This undergraduate-level course is provided by MIT free of charge and is intended for students studying Mathematics or Engineering.

Combinatorial Optimization: Course Specifics

Degree Level Free Audio Video Downloads
Undergraduate Yes No No Yes

Lectures/Notes Study Materials Tests/Quizzes
Yes Yes No

Combinatorial Optimization: Course Description

'Combinatorial Optimization,' taught by Massachusetts Institute of Technology (MIT) Professor Santosh Vempala, provides a complete overview of linear programming and combinatorial optimization. Combinatorial optimization focuses on finding the best solution to a particular problem, whether it is how to get the most profit out of a production line or how to optimally design a bridge. Network flow and matching theory are just a few of the subjects covered during the duration of this undergraduate-level course. The course focuses on the application of these principles to developing algorithms used for solving real-world problems. The course's problem sets work to help students develop these skills.

This OpenCourseWare provides downloadable lecture notes, four problem sets and a list of recommended readings. If you're interested in this course, visit the combinatorial optimization course page.

Featured School Choices: