MATH 8120 - Discrete Optimization

Institution:

Clemson University

Subject:

Mathematical Sciences

Description:

Principal methods used in integer programming and discrete optimization; branch and bound, implicit enumeration, cutting planes, group knapsack, Lagrangian relaxation, surrogate constraints, heuristics (performance analysis), separation/branching strategies, and polynomial time algorithms for specific problems on special structures. Offered fall semester only. Students are expected to have completed a graduate-level course in linear programming before enrolling in this course.

Credits:

3.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.clemson.edu

Phone Number:

(864) 656-4636

Regional Accreditation:

Southern Association of Colleges and Schools

Calendar System:

Semester

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.