(Formerly CS258)

Solving Hard Problems in Combinatorial Optimization: Theory and Systems

Not offered this year
Offered discontinued, last taught:

Summer 2018

Addresses not only the theory of combinatorial optimization but also how it is embodied in practical (industrial and logistical) systems. Explores some of the issues and obstacles 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 and resource allocation. Prerequisites: CSCI0320 or CSCI0360, and basic knowledge of linear algebra.