425 - Introduction to Combinatorial Optimization
Prerequisites:
Math 221 or Comp Sci 302, or consent of instructor.
Frequency:
Irregular.
Student Body:
Students in Computer Science and Industrial Engineering
Credits:
3. (P-I) Recent Texts:
This course is run by the Computer Science department
Background and Goals:
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. Please, consult the Computer Science department for more information.
Alternatives:
n/a
Subsequent Courses:
n/a