DSES 6760 - Combinatorial Optimization and Integer Programming

Institution:

Rensselaer Polytechnic Institute

Subject:

Description:

Review of exact and heuristic methods for solving discrete problems, including the traveling salesman problem, the knapsack problem, packing and covering problems. Algorithm complexity and NP-completeness, cutting plane methods and polyhedral theory, branch and bound, simulated annealing, tabu search, Lagrangian duality. Prerequisites/Corequisites: Prerequisite: DSES 4770 (MATH 4700). When Offered: Spring term odd-numbered years. Cross Listed: Cross-listed as MATP 6620. Students cannot obtain credit for both this course and MATP 6620. Credit Hours: 4

Credits:

4.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.rpi.edu

Phone Number:

(518) 276-6000

Regional Accreditation:

Middle States 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.