I SY E 425: Introduction to Combinatorial Optimization
- Catalog Description:
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.
- Credits: 3
- Prerequisites: Math 221 or Comp Sci 302 or cons inst
- Official Course Description (pdf)
Moodle and D2L are being retired. Already, many Engineering courses are in Canvas rather than Moodle. Rather than using the Moodle links below, it is recommended that you use the Learn@UW site (learnuw.wisc.edu) to gain access to all of the LSM choices available to campus.
- Engineering Moodle Courses on the Web
- Create an Engineering Moodle Course Homepage (formerly eCOW2)