Introduction to Combinatorial Optimization

CS 425

Credits: 

3

Exact and heuristic methods for key combinatorial optimization problems such as: shortest path, maximum flow problems, and the traveling salesman problem. Techniques include problem-specific methods and general approaches such as branch-and-bound, genetic algorithms, simulated annealing, and neural networks. (Infrequently offered.) Prereq: Math 221 or CS 302 or consent of instructor.

Crosslisted Departments: 

Subscribe to RSS - Introduction to Combinatorial Optimization