Publisher's Synopsis
The authors introduce a method for solving combinatorial optimization problems that combines constraint programming with local search, using constraints to describe & control local search, & a programming language, COMET to support both modeling & search abstractions in the spirit of constraint programming.