Main Profile

At A Glance

Integer Programming and Combinatorial Optimization

The course is a comprehensive introduction to the theory, algorithms and applications of integer optimization and is organized in four parts: formulations and relaxations, algebra and geometry of integer optimization, algorithms for integer optimization, and extensions of integer optimization.

Start Date: Sep 01, 2009
Cost: Free

Contact

Integer Programming and Combinatorial Optimization's Full Profile

Overview

Description

The course is a comprehensive introduction to the theory, algorithms and applications of integer optimization and is organized in four parts: formulations and relaxations, algebra and geometry of integer optimization, algorithms for integer optimization, and extensions of integer optimization.

Details

  • Dates: Sep 01, 2009 to Dec 20, 2009
  • Days of the Week: Monday, Tuesday, Wednesday, Thursday, Friday, Saturday, Sunday
  • Level of Difficulty: Beginner
  • Size: Massive Open Online Course
  • Instructors: Prof. Andreas Schulz, Prof. Dimitris Bertsimas
  • 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 Integer Programming and Combinatorial Optimization

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

  • Answer