CS 674 - HEURISTIC ALGORITHMS

College of Engineering

Credits: 3

Solving problems that are intractable. Exact techniques such as search integer programming and dynamic programming. Approximation techniques including local search, divide and conquer, and greedy algorithms. Methods based upon natural models such as force-directed iteration, simulated annealing, genetic algorithms, and neural networks. Examples will be selected from active research areas.

Prerequisite(s):
Prereq: CS 515 or consent of instructor.