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.

Download your free White Paper

Subject to the Privacy Notice I consent to FICO using my contact data provided above to contact me by phone or email to provide information regarding FICO, its products and services, and other similar FICO products and services.

I agree to the Terms and Privacy Notice.