Go to Main Content

UR Self-Service

 

HELP | EXIT

Detailed Course Information

 

2025 Winter
Apr 22, 2025
Transparent Image
Information 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
Transparent Image
Skip to top of page
Release: 8.7.2.4