Ir al contenido principal
Primer plano de manos sobre una notebook

Hybrid MIP/CP solving with Xpress-Optimizer and Xpress-Kalis

This paper describes several examples of combining Mathematical Programming (LP and MIP) solution techniques with Constraint Programming.

White Paper

For the implementation we use Xpress-Optimizer and Artelys-Kalis from the Mosel language (Mosel modules mmxprs and kalis).

In the first example CP propagation is used as preprocessor for LP solving; in the second example CP solving is employed as a cut generation heuristic for a MIP branch-and-cut algorithm.