Go to Main Content

Brown University

 

HELP | EXIT

Detailed Course Information

 

Spring 2020
Sep 17, 2019
Transparent Image
  Select the desired Level or 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

Prerequisites:
Undergraduate level CSCI 0320 Minimum Grade of S

Return to Previous New Search
Transparent Image
Skip to top of page
Release: 8.7.2.4