18 433 - Combinatorial Optimization

Institution:

Massachusetts Institute of Technology

Subject:

Description:

Thorough treatment of linear programming and combinatorial optimization. Topics include matching theory, network flow, matroid optimization, and how to deal with NP-hard optimization problems. Prior exposure to discrete mathematics (such as 18.310) helpful.

Credits:

3.00

Credit Hours:

Prerequisites:

Prereq: 18.06, 18.700, or 18.701

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

web.mit.edu/student/

Phone Number:

(617) 253-1000

Regional Accreditation:

New England Association of Schools and Colleges

Calendar System:

Four-one-four plan

The Course Profile information is provided and updated by third parties including the respective institutions. While the institutions are able to update their information at any time, the information is not independently validated, and no party associated with this website can accept responsibility for its accuracy.