[图书][B] Decision diagrams for optimization
This introductory chapter explains the motivation for developing decision diagrams as a new
discrete optimization technology. It shows how decision diagrams implement the five main …
discrete optimization technology. It shows how decision diagrams implement the five main …
STR2: optimized simple tabular reduction for table constraints
C Lecoutre - Constraints, 2011 - Springer
Table constraints play an important role within constraint programming. Recently, many
schemes or algorithms have been proposed to propagate table constraints and/or to …
schemes or algorithms have been proposed to propagate table constraints and/or to …
Decision diagrams for discrete optimization: A survey of recent advances
In the last decade, decision diagrams (DDs) have been the basis for a large array of novel
approaches for modeling and solving optimization problems. Many techniques now use DDs …
approaches for modeling and solving optimization problems. Many techniques now use DDs …
Bit-vector algorithms for binary constraint satisfaction and subgraph isomorphism
JR Ullmann - Journal of Experimental Algorithmics (JEA), 2011 - dl.acm.org
A solution to a binary constraint satisfaction problem is a set of discrete values, one in each
of a given set of domains, subject to constraints that allow only prescribed pairs of values in …
of a given set of domains, subject to constraints that allow only prescribed pairs of values in …
An MDD-based generalized arc consistency algorithm for positive and negative table constraints and some global constraints
KCK Cheng, RHC Yap - Constraints, 2010 - Springer
A table constraint is explicitly represented as its set of solutions or non-solutions. This ad hoc
(or extensional) representation may require space exponential to the arity of the constraint …
(or extensional) representation may require space exponential to the arity of the constraint …
A systematic approach to MDD-based constraint programming
S Hoda, WJ Van Hoeve, JN Hooker - Principles and Practice of Constraint …, 2010 - Springer
Fixed-width MDDs were introduced recently as a more refined alternative for the domain
store to represent partial solutions to CSPs. In this work, we present a systematic approach …
store to represent partial solutions to CSPs. In this work, we present a systematic approach …
Improving GAC-4 for table and MDD constraints
Abstract We introduce GAC-4R, MDD-4, and MDD-4R three new algorithms for maintaining
arc consistency for table and MDD constraints. GAC-4R improves the well-known GAC-4 …
arc consistency for table and MDD constraints. GAC-4R improves the well-known GAC-4 …
XCSP3: an integrated format for benchmarking combinatorial constrained problems
F Boussemart, C Lecoutre, G Audemard… - arXiv preprint arXiv …, 2016 - arxiv.org
We propose a major revision of the format XCSP 2.1, called XCSP3, to build integrated
representations of combinatorial constrained problems. This new format is able to deal with …
representations of combinatorial constrained problems. This new format is able to deal with …
PYCSP3: modeling combinatorial constrained problems in python
C Lecoutre, N Szczepanski - arXiv preprint arXiv:2009.00326, 2020 - arxiv.org
In this document, we introduce PyCSP $3 $, a Python library that allows us to write models of
combinatorial constrained problems in a declarative manner. Currently, with PyCSP $3 …
combinatorial constrained problems in a declarative manner. Currently, with PyCSP $3 …
Xcsp3-core: A format for representing constraint satisfaction/optimization problems
F Boussemart, C Lecoutre, G Audemard… - arXiv preprint arXiv …, 2020 - arxiv.org
In this document, we introduce XCSP3-core, a subset of XCSP3 that allows us to represent
constraint satisfaction/optimization problems. The interest of XCSP3-core is multiple:(i) …
constraint satisfaction/optimization problems. The interest of XCSP3-core is multiple:(i) …