|Select the Course Number to get further detail on the course. Select the desired Schedule Type to find available classes for the course.|
|CSCI 2580 - Solving Hard Problems in Combinatorial Optimization: Theory and Systems|
The theory of combinatorial optimization and how it is embodied in practical systems. Explores issues encountered in implementing such systems. Emphasizes the wide variety of techniques and methodologies available, including integer programming, local search, constraint programming, and approximation algorithms. Problems addressed may include: scheduling, coloring, traveling salesman tours, and resource allocation. Prerequisites: CSCI 0320 and basic knowledge of linear algebra.
1.000 Credit hours
1.000 Lecture hours
Levels: Graduate, Undergraduate
Schedule Types: Primary Meeting
Computer Science Department