MATP 6620 - Combinatorial Optimization and Integer Programming

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: MATP 4700 or DSES 4770.

When Offered: Spring term odd-numbered years.



Cross Listed: (Cross listed as DSE 6760. Students cannot obtain credit for both this course and DSES 6760.)

Credit Hours: 4


Print-Friendly Page (opens a new window)
Close Window