![]() | Select the desired Level or Schedule Type to find available classes for the course. |
CS 890CO - Heuristic Algorithms in Optim |
In this course, we will study state-of-the-art heuristic algorithms for finding approximation solutions, including simulated annealing, genetic algorithms, ant colony algorithms, tabu search and others.
3.000 Credit hours 0.000 TO 3.000 Lecture hours 0.000 TO 3.000 Other hours Levels: Graduate Schedule Types: Lecture, Report, Independent Study, Directed Reading, Examination Computer Science Department Restrictions: Must be enrolled in one of the following Levels: Graduate |
Return to Previous | New Search |
![]() |