Relations between MDDs and Tuples and Dynamic Modifications of MDDs based constraints

05/11/2015
by   Guillaume Perez, et al.
0

We study the relations between Multi-valued Decision Diagrams (MDD) and tuples (i.e. elements of the Cartesian Product of variables). First, we improve the existing methods for transforming a set of tuples, Global Cut Seeds, sequences of tuples into MDDs. Then, we present some in-place algorithms for adding and deleting tuples from an MDD. Next, we consider an MDD constraint which is modified during the search by deleting some tuples. We give an algorithm which adapts MDD-4R to these dynamic and persistent modifications. Some experiments show that MDD constraints are competitive with Table constraints.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/07/2009

Toward an automaton Constraint for Local Search

We explore the idea of using finite automata to implement new constraint...
research
02/25/2016

Firefly Algorithm for optimization problems with non-continuous variables: A Review and Analysis

Firefly algorithm is a swarm based metaheuristic algorithm inspired by t...
research
05/22/2020

Algebraic Global Gadgetry for Surjective Constraint Satisfaction

The constraint satisfaction problem (CSP) on a finite relational structu...
research
09/23/2019

Compiling Stochastic Constraint Programs to And-Or Decision Diagrams

Factored stochastic constraint programming (FSCP) is a formalism to repr...
research
03/14/2019

Multi-Robot Routing for Persistent Monitoring with Latency Constraints

In this paper we study a multi-robot path planning problem for persisten...
research
06/15/2017

Conjunctions of Among Constraints

Many existing global constraints can be encoded as a conjunction of amon...
research
01/10/2013

A Bayesian Approach to Tackling Hard Computational Problems

We are developing a general framework for using learned Bayesian models ...

Please sign up or login with your details

Forgot password? Click here to reset