Courses:

Mathematics and Statistics >> 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.997 (Spring 2004) 
  • Course Title:
  • Topics in Combinatorial Optimization 
  • Course Level:
  • Graduate 
  • Offered by :
  • Massachusetts Institute of Technology (MIT)
    Massachusetts, United States  
  • Department:
  • Mathematics 
  • Course Instructor(s):
  • Prof. Michel Goemans 
  • Course Introduction:
  •  


  • 18.997 Topics in Combinatorial Optimization



    Spring 2004




    Course Highlights


    This course includes a full set of  lecture notes and assignments.


    Course Description


    In this graduate-level course, we will be covering advanced topics in combinatorial optimization. We will start with non-bipartite matchings and cover many results extending the fundamental results of matchings, flows and matroids. The emphasis is on the derivation of purely combinatorial results, including min-max relations, and not so much on the corresponding algorithmic questions of how to find such objects. The intended audience consists of Ph.D. students interested in optimization, combinatorics, or combinatorial algorithms.
     

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






© 2017 Coursepedia.com, by Higher Ed Media LLC. All Rights Reserved.