ISyE 425: Introduction to Combinatorial Optimization

Home : Courses :
ISyE 425 - Introduction to Combinatorial Optimization

WWW Resources

Timetable Information

Engineering Courses on the Web (eCOW)

eCOW2 Courses

Edit This Page
Engineering Courses on the Web (eCOW)
Catalog Description: 425 Introduction to Combinatorial Optimization. (Crosslisted with Ind Engr, Math 425.) II; 3cr. 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. P:Math 221 or Comp Sci 302 or cons inst.
Course Prerequisite(s)

See catalog description above.

Copyright 2007 The Board of Regents of the University of Wisconsin System
Date last modified: 28-Dec-2007
Content by: prpeters@engr.wisc.edu
Accessibility

Web services
Thank you for visiting http://www.engr.wisc.edu//ie/courses/ie425.html

eCOW2 Courses