CS 5722: Heuristic Methods for Optimization

Cross-Listing: CEE 5290 (parent), CS 5722, ORIE 5340.

This course teaches heuristic search methods including simulated annealing, tabu search, genetic algorithms, derandomized evolution strategy, and random walk developed for optimization of combinatorial- and continuous-variable problems. Application project options include wireless networks, protein folding, job shop scheduling, partial differential equations, satisfiability, or independent projects. Statistical methods are presented for comparing algorithm results. Advantages and disadvantages of heuristic search methods for both serial and parallel computation are discussed in comparison with other optimization algorithms.

Offered: Fall only

Prerequisites: CS/ENGRD 2110 or 3220, or CEE/ENGRD 3200, or graduate standing, or permission of instructor

Grade options: Letter or S/U

Credit hours: 3

Recent offerings:

• http://www.cs.cornell.edu/courses/cs5722/2009fa
• http://www.cs.cornell.edu/courses/cs572/2007fa
  • Chris Shoemaker
• http://www.cs.cornell.edu/courses/cs572/2004fa
  • Chris Shoemaker