Courses:

Mathematics and Statistics >> Applied Mathematics


For Course Instructors

  • Advertise your course for free
  • Feature your course listing
  • Create course discussion group
  • Link to your course page
  • Increase student enrollment

More Info...>>


Course Info

  • Course Number / Code:
  • 18.433 (Fall 2003) 
  • Course Title:
  • Combinatorial Optimization 
  • Course Level:
  • Undergraduate 
  • Offered by :
  • Massachusetts Institute of Technology (MIT)
    Massachusetts, United States  
  • Department:
  • Mathematics 
  • Course Instructor(s):
  • Prof. Santosh Vempala 
  • Course Introduction:
  •  


  • 18.433 Combinatorial Optimization



    Fall 2003




    Course Highlights


    This course includes a full set of lecture notes, plus problems sets.


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

    *Some translations represent previous versions of courses.

     

ACKNOWLEDGEMENT:
This course content is a redistribution of MIT Open Courses. Access to the course materials is free to all users.






© 2010-2017 OpenHigherEd.com, All Rights Reserved.
Open Higher Ed ® is a registered trademark of AmeriCareers LLC.