MIT OpenCourseWare

Browse materialsMIT 15.083J · Fall 2009

Integer Programming and Combinatorial Optimization

Subjects: Management · Mathematics · Programming

Art: C. Morrison (engraver); Dodd, Robert (artist and…, An Outward bound East Indiaman sailing from the Downs - RMG PY8445, 29 May 1788 · Public domain

Instructors: Prof. Dimitris Bertsimas, Prof. Andreas Schulz
Term: Fall 2009
Level: Graduate
What's inside: 1 lecture note · 1 reading · 36 other files · 3 web pages
Materials open: MIT OCW

Start here

Start course: Lecture 1: Formulations Find a topic

Progress is saved in this browser.

Export or import progress

About this course

Source: MIT OpenCourseWare 15.083J Integer Programming and Combinatorial Optimization, Fall 2009, Prof. Dimitris Bertsimas, Prof. Andreas Schulz — original course page on ocw.mit.edu ↗. License: CC BY-NC-SA 4.0. Study order: MIT's own listing order, section by section. Taken from MIT's published course files, downloaded from ocw.mit.edu on September 23, 2026. How RedLectern is built.

Materials are grouped the way MIT organized them. A verified, course-wide order has not been established here.

Has MIT solutions 8 files in this course are named by MIT as solutions.

Before you start

Prerequisites are not listed here. Check MIT's own syllabus for this course.

How this course was organized

What's here, and what isn't

A lecture sequence of 25 items is confirmed. Assignment and exam materials exist too, but MIT's own order for them could not be verified, so they're shown as materials below rather than a sequence.

Not included here

1 item from the source could not be safely included:

Referenced in a table, but without MIT's own verified order, so it isn't used to claim a sequence.

Materials by section

Grouped by section, as MIT organized them. Not sequenced or ordered.

Lecture Notes

25 files

Assignments

Lec #19PDF Download

Exams

Other materials from this course

8 files

MIT OpenCourseWare, Prof. Dimitris Bertsimas, Prof. Andreas Schulz, 15.083J Integer Programming and Combinatorial Optimization, Fall 2009.

License: CC BY-NC-SA 4.0 · Edition: Fall 2009 · Open the original course on OCW ↗

Organized by RedLectern, independent of MIT and not endorsed by MIT.

Per-resource rights are recorded on each resource; All-Rights-Reserved items are link-only, never mirrored.

Integer Programming and Combinatorial Optimization

Before you start

What's here, and what isn't

Not included here

Materials by section

Lecture Notes

Assignments

Exams

Other materials from this course

Lecture 1: Formulations

Lecture 2: Complexity

Lecture 3: Methods to enhance formulations I

Lecture 4: Methods to enhance formulations II

Lecture 5: Ideal formulations I

Lecture 6: Ideal formulations II

Lecture 7: Ideal formulations III

Lecture 8: Duality theory I

Lecture 9: Duality theory II

Lecture 10: Algorithms for solving relaxations

Lecture 11: Robust discrete optimization

Lecture 12: Lattices I

Lecture 13: Lattices II

Lecture 14: Algebraic geometry I

Lecture 15: Algebraic geometry II

Lecture 16: Geometry

Lecture 17: Cutting plane methods I

Lecture 18: Cutting plane methods II

Lecture 19: Enumerative methods

Lecture 20: Heuristic methods

Lecture 21: Approximation algorithsm I

Lecture 22: Approximation algorithms II

Lecture 23: Approximation algorithms III

Lecture 24: Mixed integer optimization I

Lecture 25: Mixed integer optimization II