Efficient problem solving techniques. Connection, search and tour problems. Branch-and-bound and backtracking. Dynamic programming. Developing heuristics.
Prerequisite: CS 561.
News & Events | People | Academics | Research | Jobs | Companies | Visitors | Computer Facilities | Home
