CEE 5290

Last Updated

  • Schedule of Classes - January 14, 2015 6:16PM EST
  • Course Catalog - January 14, 2015 6:21PM EST

CEE 5290
Heuristic Methods for Optimization

Course information provided by the 2014-2015 Catalog.

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.


Prerequisites/Corequisites Prerequisites: CS 2110/ENGRD 2110; ENGRD 3200 or permission of instructor.

Permission Note Enrollment limited to: graduate standing.

When Offered Fall.

View Enrollment Information

Syllabi: none

  •   Regular Academic Session.  Combined with: CS 5722, ORIE 5340

  • 3-4 Credits Stdnt Opt

  • 12089 CEE 5290   LEC 001

  •  

  • Instruction Mode: