"Model and Run" Constraint Networks with a MILP Engine

TL;DR

This paper introduces MICE, a Java-based constraint programming modeler that leverages MILP solvers to simplify modeling and broaden accessibility, featuring new decompositions for constraints.

Contribution

The paper presents MICE, a novel CP modeling tool that integrates MILP solvers, enabling easier use and new constraint decompositions for improved problem solving.

Findings

MICE can effectively model and solve CP problems using MILP solvers.

New decompositions improve the expressiveness and efficiency of constraint modeling.

MICE demonstrates competitive performance on benchmark problems.

Abstract

Constraint Programming (CP) users need significant expertise in order to model their problems appropriately, notably to select propagators and search strategies. This puts the brakes on a broader uptake of CP. In this paper, we introduce MICE, a complete Java CP modeler that can use any Mixed Integer Linear Programming (MILP) solver as a solution technique. Our aim is to provide an alternative tool for democratizing the "CP-style" modeling thanks to its simplicity of use, with reasonable solving capabilities. Our contributions include new decompositions of (reified) constraints and constraints on numerical variables.