Solution Counting Algorithms for Constraint-Centered Search Heuristics

DOI10.1007/978-3-540-74970-7_52MaRDI QIDQ3523086zbMATH OpenOpenAlexFDO

Authors Alessandro Zanarini, Gilles Pesant

Publication date 2 September 2008

Published in Principles and Practice of Constraint Programming – CP 2007 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-74970-7_52

Mathematics Subject Classification ID

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

Recommendations

• Solution counting algorithms for constraint-centered search heuristics
• Counting-based search: branching heuristics for constraint satisfaction problems
• More robust counting-based search heuristics with alldifferent constraints
• Counting Solutions of Knapsack Constraints
• Accelerating counting-based search

Cites work

• A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents
• A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries
• Active-constraint variable ordering for faster feasibility of mixed integer linear programs
• Approximating the permanent: A simple approach
• Clifford algebras and approximating the permanent
• Exact sampling from perfect matchings of dense regular bipartite graphs
• Model counting: a new stategy for obtaining good bounds
• Polynomial Time Algorithms to Approximate Permanents and Mixed Discriminants Within a Simply Exponential Factor
• Principles and Practice of Constraint Programming – CP 2004
• Principles and Practice of Constraint Programming – CP 2004
• Principles and Practice of Constraint Programming – CP 2004
• The complexity of computing the permanent

Cited in

(12)

• Accelerating counting-based search
• Counting weighted spanning trees to solve constrained minimum spanning tree problems
• Solution counting algorithms for constraint-centered search heuristics
• Achieving domain consistency and counting solutions for dispersion constraints
• Counting-based search: branching heuristics for constraint satisfaction problems
• Recovering indirect solution densities for counting-based branching heuristics
• More robust counting-based search heuristics with alldifferent constraints
• CSPs with counters: a likelihood-based heuristic
• Revisiting counting solutions for the global cardinality constraint
• Counting Solutions of Knapsack Constraints
• The weighted grammar constraint
• Principles and Practice of Constraint Programming – CP 2004

This page was built for publication: Solution Counting Algorithms for Constraint-Centered Search Heuristics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3523086)