In recent years, it has been increasingly recognized that constraint and integer programming have orthogonal and complementary strengths in stating and solving combinatorial optimization applications. In addition, their integration has become an active research topic. The optimization programming language OPL was a first attempt at integrating these technologies both at the language and at the solver levels. In particular, OPL is a modeling language integrating the rich language of constraint programming and the ability to specify search procedures at a high level of abstraction. Its implementation includes both constraint and mathematical programming solvers, as well as some cooperation schemes to make them collaborate on a given problem. The purpose of this paper is to illustrate, using OPL, the constraint-programming approach to combinatorial optimization and the complementary strengths of constraint and integer programming.
['Pascal Van Hentenryck']
Constraint and Integer Programming in OPL