Design, analysis, and implementation of algorithms for combinatorial optimization problems. Introduction to theoretical analysis of algorithms and applications that can be formulated as combinatorial optimization problems. Specific topics include complexity analysis, network flow problems, traveling salesperson problems, matching problems, knapsack problems, and greedy algorithms. Implementation of combinatorial algorithms in a commercial software language. An introduction to this software language will be given at the beginning of the course.
| Spring | Summer | Fall | ||
|---|---|---|---|---|
| (Session 1) | (Session 2) | |||
| 2023 | ||||
| 2022 | ||||
| 2021 | ||||
| 2020 | ||||
| 2019 | ||||
| 2018 | ||||
| 2017 | ||||
| 2016 | ||||
| 2015 | ||||
| 2014 | ||||
| 2013 | ||||
| 2012 | ||||
| 2011 | ||||
| 2010 | ||||
| 2009 | ||||
| 2008 | ||||
| 2007 | ||||
| 2006 | ||||
| 2005 | ||||
| 2004 | ||||
| 2003 | ||||
| 2002 | ||||
| 2001 | ||||
| 2000 | ||||
| 1999 | ||||
| 1998 | ||||