Combining finite and continuous solvers

02/06/2014
by   Jean-Guillaume Fages, et al.
0

Combining efficiency with reliability within CP systems is one of the main concerns of CP developers. This paper presents a simple and efficient way to connect Choco and Ibex, two CP solvers respectively specialised on finite and continuous domains. This enables to take advantage of the most recent advances of the continuous community within Choco while saving development and maintenance resources, hence ensuring a better software quality.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/26/2017

SUNNY-CP and the MiniZinc Challenge

In Constraint Programming (CP) a portfolio solver combines a variety of ...
research
12/01/2013

A Combined Approach for Constraints over Finite Domains and Arrays

Arrays are ubiquitous in the context of software verification. However, ...
research
03/19/2021

Integer and Constraint Programming Revisited for Mutually Orthogonal Latin Squares

In this paper we provide results on using integer programming (IP) and c...
research
09/07/2020

sunny-as2: Enhancing SUNNY for Algorithm Selection

SUNNY is an Algorithm Selection (AS) technique originally tailored for C...
research
12/03/2019

From MiniZinc to Optimization Modulo Theories, and Back (Extended Version)

Optimization Modulo Theories (OMT) is an extension of SMT that allows fo...
research
06/08/2023

Linking Frequentist and Bayesian Change-Point Methods

We show that the two-stage minimum description length (MDL) criterion wi...
research
11/24/2017

Is Non-Neutrality Profitable for the Stakeholders of the Internet Market? - Part II

In this part of the paper, we obtain analytical results for the case tha...

Please sign up or login with your details

Forgot password? Click here to reset