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

Description:
 
Covers material in first and second semester calculus but it is intended to teach math majors to write and understand proofs in mathematics in general and in calculus in particular.
 
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

Alternatives: 

n/a
 
Subsequent Courses: 
 
n/a
credits: 
3. (P-I)
semester: 
Irregular
prereqs: 
(MATH 320, 340, 341 or 375) or graduate or professional standing or member of the Pre-Masters Mathematics (Visiting International) Program

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