A MIP Backend for the IDP System

09/02/2016
by   San Pham, et al.
0

The IDP knowledge base system currently uses MiniSAT(ID) as its backend Constraint Programming (CP) solver. A few similar systems have used a Mixed Integer Programming (MIP) solver as backend. However, so far little is known about when the MIP solver is preferable. This paper explores this question. It describes the use of CPLEX as a backend for IDP and reports on experiments comparing both backends.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/27/2016

"Model and Run" Constraint Networks with a MILP Engine

Constraint Programming (CP) users need significant expertise in order to...
research
04/28/2017

Kiwi - A Minimalist CP Solver

Kiwi is a minimalist and extendable Constraint Programming (CP) solver s...
research
03/18/2021

MILP for the Multi-objective VM Reassignment Problem

Machine Reassignment is a challenging problem for constraint programming...
research
07/01/2023

Solving break minimization problems in mirrored double round-robin tournament with QUBO solver

The break minimization problem is a fundamental problem in sports schedu...
research
11/07/2022

Optimizing Wi-Fi Channel Selection in a Dense Neighborhood

In dense neighborhoods, there are often dozens of homes in close proximi...
research
07/11/2018

Testing Global Constraints

Every Constraint Programming (CP) solver exposes a library of constraint...
research
03/16/2017

A Visual Web Tool to Perform What-If Analysis of Optimization Approaches

In Operation Research, practical evaluation is essential to validate the...

Please sign up or login with your details

Forgot password? Click here to reset