Main Profile

At A Glance

Combinatorial Optimization

Combinatorial 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.

Start Date: Sep 01, 2003
Cost: Free

Contact

Combinatorial Optimization's Full Profile

Overview

Description

Combinatorial 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.

Details

  • Dates: Sep 01, 2003 to Dec 20, 2003
  • Days of the Week: Monday, Tuesday, Wednesday, Thursday, Friday, Saturday, Sunday
  • Level of Difficulty: Beginner
  • Size: Massive Open Online Course
  • Instructor: Prof. Santosh Vempala
  • Cost: Free
  • Institution: MIT OCW

Provider Overview

About MIT OCW: MIT OpenCourseWare (OCW) is a web-based publication of virtually all MIT course content. OCW is open and available to the world and is a permanent MIT activity.

Latest Tweet

Questions about Combinatorial Optimization

Want more info about Combinatorial Optimization? Get free advice from education experts and Noodle community members.

  • Answer