Main Profile

At A Glance

Topics in Combinatorial Optimization

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, comb...

Start Date: Feb 01, 2004
Cost: Free

Contact

Topics in Combinatorial Optimization's Full Profile

Overview

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.

Details

  • Dates: Feb 01, 2004 to May 25, 2004
  • Days of the Week: Monday, Tuesday, Wednesday, Thursday, Friday, Saturday, Sunday
  • Level of Difficulty: Advanced
  • Size: Massive Open Online Course
  • Instructor: Prof. Michel Goemans
  • 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 Topics in Combinatorial Optimization

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

  • Answer