Department of Mathematics

Van Vleck Hall, 480 Lincoln Drive, Madison, WI

Math 425: Introduction to Combinatorial Optimization

 
Student Body: 

Students in Computer Science and Industrial Engineering

 
 
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

credits: 
3. (P-I)
semester: 
Irregular
prereqs: 
Math 221 or Comp Sci 302, or consent of instructor.

UW-Madison Department of Mathematics
Van Vleck Hall
480 Lincoln Drive
Madison, Wi  53706

(608) 263-3054

Contact Us

Got a question about
accessibility, content
or structure of this website?
webmaster@math.wisc.edu