Integer Programming and Combinatorial Optimization's Full Profile
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.
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
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.
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.
MIT OpenCourseWare (MIT OCW) is an initiative of the Massachusetts Institute of Technology (MIT) to put all of the educational materials from its undergraduate- and graduate-level courses online, partly free and openly available to anyone, anywhere.