Material Detail
15.083J / 6.859 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.
Quality
- User Rating
- Comments
- Learning Exercises
- Bookmark Collections
- Course ePortfolios
- Accessibility Info
More about this material
- Material Type:
- Online Course
- Date Added to MERLOT:
- June 9, 2011
- Date Modified in MERLOT:
- June 12, 2018
- Author:
- Prof. Dimitris Bertsimas
- Submitter:
-
Cathy Swift
- Primary Audience:
- College General Ed, College Lower Division
- Mobile Compatibility:
- Not specified at this time
- Language:
- English
- Cost Involved:
- No
- Source Code Available:
- Unknown
- Accessibility Information Available:
- Unknown
- Creative Commons:
-
This work is licensed under a Attribution-NonCommercial-ShareAlike 3.0 United States
