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
White Paper
Data Spiders: Leveraging Transactional Data with Genetic Algorithms
White Paper
Are You Paying Too Much for Clicks?
White Paper
Optimizing Trade-Offs for Strategic Portfolio Management
Brochure
Optimizing Your Marketing Activities to Maximize Your Margins and Profitability
Take the next step
Connect with FICO for answers to all your product and solution questions. We look forward to hearing from you.