# Integer and Combinatorial Optimization

## ISYE-6760

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.

4 credits
Cross-listed with:
MATP-6620 Integer and Combinatorial Optimization
Prereqs:
none

# Past Term Data
Offered
Not Offered
Offered as Cross-Listing Only
No Term Data
Simple View
Detailed View

| Spring | Summer | Fall
--- | --- | --- | ---
| (Session 1) | (Session 2) |
2023 |  |  |
2022 |  |  |
2021 | Integer & Combinatorial Opt. (4c) John E. Mitchell Seats Taken: 7/15 |  |
2020 |  |  |
2019 | Integer & Combinatorial Opt. (4c) John E. Mitchell Seats Taken: 7/30 |  |
2018 |  |  |
2017 | Combin Optim & Integer Progr (4c) John E. Mitchell Seats Taken: 4/30 |  |
2016 |  |  |
2015 | Combin Optim & Integer Progr (4c) John E. Mitchell Seats Taken: 7/30 |  |
2014 |  |  |
2013 | Combin Optim & Integer Progr (4c) John E. Mitchell Seats Taken: 3/30 |  |
2012 |  |  |
2011 | Combin Optim & Integer Progr (4c) John E. Mitchell Seats Taken: 6/30 |  |
2010 |  |  |
2009 |  |  |
2008 |  |  |
2007 |  |  |
2006 |  |  |
2005 |  |  |
2004 |  |  |
2003 |  |  |
2002 |  |  |
2001 |  |  |
2000 |  |  |
1999 |  |  |
1998 |  |  |