Counting-Based Search: Branching Heuristics for Constraint Satisfaction Problems

DOI10.1613/jair.3463zbMath1237.68193arXiv1401.4601OpenAlexW2170780172WikidataQ129490055 ScholiaQ129490055MaRDI QIDQ2887069

Claude-Guy Quimper, Gilles Pesant, Alessandro Zanarini

Publication date: 16 May 2012

Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1401.4601

zbMATH Keywords

search heuristicconstraint programmingbranching heuristics

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (9)

Optimization bounds from decision diagrams in Haddock ⋮ Using dual presolving reductions to reformulate cumulative constraints ⋮ Dynamic Branching in Qualitative Constraint Networks via Counting Local Models ⋮ Shift-and-propagate ⋮ Counting weighted spanning trees to solve constrained minimum spanning tree problems ⋮ A constraint programming primer ⋮ Dynamic branching in qualitative constraint-based reasoning via counting local models ⋮ A new branch-and-filter exact algorithm for binary constraint satisfaction problems ⋮ STR3: a path-optimal filtering algorithm for table constraints

This page was built for publication: Counting-Based Search: Branching Heuristics for Constraint Satisfaction Problems