Advanced Search
DSpace@MIT

15.083J / 6.859 Integer Programming and Combinatorial Optimization, Fall 2004

Research and Teaching Output of the MIT Community

15.083J / 6.859 Integer Programming and Combinatorial Optimization, Fall 2004

Download
Alternative Title: Integer Programming and Combinatorial Optimization
Author: Bertsimas, Dimitris
Date Issued: 2004-12
Abstract:
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.
URI: http://hdl.handle.net/1721.1/67871
Other Identifiers: 15.083J-Fall2004
Other Identifiers: 15.083J
6.859
IMSCP-MD5-1161322b1a0c967c85a542cf2a849d3c
Has Version: http://www.core.org.cn/OcwWeb/Sloan-School-of-Management/15-083jFall-2004/CourseHome/index.htm
Keywords: theory, algorithms, integer optimization, formulations and relaxations, algebra and geometry of integer optimization, algorithms for integer optimization, extensions of integer optimization, 15.083J, 6.859, 15.083, 143701, Operations Research

Show full item metadata

Files in this item

Name Size Format Description
15-083j-fall-2004 ... 15.96Kb HTML

The following license files are associated with this item:

This item appears in the following Collection(s)

MIT-Mirage