Constraint Classes and Solvers

Abstract

This is the most technical chapter in the book, as it describes the main algorithms used to solve problems of the different classes introduced in the previous chapter. It covers the simplex algorithm for solving linear constraints, satisfiability algorithms for propositional constraints, join, projection and dynamic programming for finite integer models, branch-and-bound and cutting planes for the integer-linear class, and Newton’s method for handling differentiable non-linear functions.