# Integer & Combinatorial Opt.

## MATP-6620

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.

4 credits
Cross-listed with:
ISYE-6760 Integer & Combinatorial Opt.
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) |
2026 |  |  |

2025

Integer & Combinatorial Opt. (4c)

- John E. Mitchell

Seats Taken: 13/25

2024 |  |  |

2023

Integer & Combinatorial Opt. (4c)

- John E. Mitchell

Seats Taken: 9/40

2022 |  |  |

2021

Integer & Combinatorial Opt. (4c)

- John E. Mitchell

Seats Taken: 14/30

2020 |  |  |

2019

Integer & Combinatorial Opt. (4c)

- John E. Mitchell

Seats Taken: 11/25

2018 |  |  |

2017

Combinat Optimizat & Int Progr (4c)

- John E. Mitchell

Seats Taken: 13/30

2016 |  |  |

2015

Combinat Optimizat & Int Progr (4c)

- Michael Joseph Conroy
- John E. Mitchell

Seats Taken: 19/30

2014 |  |  |

2013

Combinat Optimizat & Int Progr (4c)

- John E. Mitchell

Seats Taken: 17/30

2012 |  |  |

2011

Combinat Optimizat & Int Progr (4c)

- John E. Mitchell

Seats Taken: 18/30

2010 |  |  |

2009

Combinat Optimizat & Int Progr (4c)

- John E. Mitchell

Seats Taken: 6/40

2008 |  |  |

2007

Combinat Optimizat & Int Progr (4c)

- John E. Mitchell

Seats Taken: 9/30

2006 |  |  |

2005

Combinat Optimizat & Int Progr (4c)

- John E. Mitchell

Seats Taken: 19/30

2004 |  |  |

2003

Combinat Optimizat & Int Progr (4c)

- John E. Mitchell

Seats Taken: 12/30

2002 |  |  |

2001

Combinat Optimizat & Int Progr (4c)

- John E. Mitchell

Seats Taken: 10/30

2000 |  |  |

1999

Comb Opt & Integer Progr (4c)

- John E. Mitchell

Seats Taken: 6/30

1998 |  |  |