| |
Apr 19, 2024
|
|
|
|
|
ISYE 6760 - Integer and Combinatorial Optimization
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: introductory course in operations research.
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
Add to Portfolio (opens a new window)
|
|
