33 citations · 91 across the 14 of their papers we have counts for
7 papers · 1 filter
SEER: Supervised Learning to Control Energetic Reasoning
Sascha Van Cauwelaert, Michele Lombardi, Pierre Schaus
One of the main strengths of Constraint Programming is the ability to reduce the search space via propagation. However, propagation is a double-edged sword, with more pruning power…
A Generic Complete Anytime Beam Search for Optimal Decision Tree
Harold Silvère Kiossou, Siegfried Nijssen, Pierre Schaus
Finding an optimal decision tree that minimizes classification error is known to be NP-hard. While exact algorithms based on MILP, CP, SAT, or dynamic programming guarantee optimal…
Improving the filtering of Branch-And-Bound MDD solver (extended)
Xavier Gillard, Vianney Coppé, Pierre Schaus +1
This paper presents and evaluates two pruning techniques to reinforce the efficiency of constraint optimization solvers based on multi-valued decision-diagrams (MDD). It adopts the…
Testing Global Constraints
Aurélie Massart, Valentin Rombouts, Pierre Schaus
Every Constraint Programming (CP) solver exposes a library of constraints for solving combinatorial problems. In order to be useful, CP solvers need to be bug-free. Therefore the t…
A Visual Web Tool to Perform What-If Analysis of Optimization Approaches
Sascha Van Cauwelaert, Michele Lombardi, Pierre Schaus
In Operation Research, practical evaluation is essential to validate the efficacy of optimization approaches. This paper promotes the usage of performance profiles as a standard pr…
Compact-Table: Efficiently Filtering Table Constraints with Reversible Sparse Bit-Sets
Jordan Demeulenaere, Renaud Hartert, Christophe Lecoutre +4
In this paper, we describe Compact-Table (CT), a bitwise algorithm to enforce Generalized Arc Consistency (GAC) on table con- straints. Although this algorithm is the default propa…