47-862 Constraint Programming

6 units, Carnegie Mellon University

The course covers the basic concepts and tools of constraint programming and how they can be integrated with integer programming and other optimization methods. Topics include constraint propagation, filtering and relaxation for global constraints, domain consistency and other types of consistency, search methods, propositional satisfiability SAT solvers, integration with cutting planes, logicbased Benders methods, CPbased column generation, decision diagrams, and modeling with global constraints. The course presupposes no knowledge of optimization.

Prerequisites: none listed

Courseweave needs JavaScript to show sections, workloads and planning tools.