| |
Apr 19, 2024
|
|
|
|
|
MATP 6620 - Integer and Combinatorial Optimization
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, Lagrangian duality, liftings, metaheuristics.
Prerequisites/Corequisites: Prerequisites: MATH 2010 and MATP 4700 or equivalent or permission of instructor.
When Offered: Spring term odd-numbered years.
Cross Listed: Cross listed as ISYE 6760. Students cannot obtain credit for both this course and ISYE 6760.
Credit Hours: 4
Add to Portfolio (opens a new window)
|
|
