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

Bertsimas, Dimitris

Author(s)

Bertsimas, Dimitris

Download15-083j-fall-2004/contents/index.htm (15.98Kb)

Alternative title

Integer Programming and Combinatorial Optimization

Terms of use

Usage Restrictions: This site (c) Massachusetts Institute of Technology 2011. Content within individual courses is (c) by the individual authors unless otherwise noted. The Massachusetts Institute of Technology is providing this Work (as defined below) under the terms of this Creative Commons public license ("CCPL" or "license") unless otherwise noted. The Work is protected by copyright and/or other applicable law. Any use of the work other than as authorized under this license is prohibited. By exercising any of the rights to the Work provided here, You (as defined below) accept and agree to be bound by the terms of this license. The Licensor, the Massachusetts Institute of Technology, grants You the rights contained here in consideration of Your acceptance of such terms and conditions.

Metadata

Show full item record

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.

Date issued

2004-12

URI

http://hdl.handle.net/1721.1/67871

Department

Sloan School of Management; Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science

Other identifiers

15.083J-Fall2004

local: 15.083J

local: 6.859

local: IMSCP-MD5-1161322b1a0c967c85a542cf2a849d3c

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

Collections

MIT OCW Archived Courses