|Select the Course Number to get further detail on the course. Select the desired Schedule Type to find available classes for the course.|
|CSCI 1490 - Introduction to Combinatorial Optimization|
This course covers the algorithmic aspects of optimizing decisions in fully observable, non-changing environments. Students are introduced to state-of-the-art optimization methods such as linear programming, integer programming, local search, and constraint programming. Strongly recommended: CSCI 0160, CSCI 0180 or CSCI 0190; CSCI 0510; and CSCI 0530 or MATH 0520 or MATH 0540.
1.000 Credit hours
1.000 Lecture hours
Levels: Graduate, Undergraduate
Schedule Types: Primary Meeting
Computer Science Department