Solution counting algorithms for constraint-centered search heuristics

DOI10.1007/S10601-008-9065-9MaRDI QIDQ2272161zbMATH OpenOpenAlexFDO

Authors Alessandro Zanarini, Gilles Pesant

Publication date 6 August 2009

Published in Constraints (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10601-008-9065-9

zbMATH Keywords

heuristic searchregular constraintalldifferent constraintsolution counting

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorics in computer science (68R05) Searching and sorting (68P10)

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

• scientific article; zbMATH DE number 3182201 (Why is no real title available?)
• 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
• Counting Solutions of Knapsack Constraints
• Exact sampling from perfect matchings of dense regular bipartite graphs
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• 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
• Solution Counting Algorithms for Constraint-Centered Search Heuristics
• Solution-guided multi-point constructive search for job shop scheduling
• The complexity of computing the permanent

Cited in

(11)

• Solution Counting Algorithms for Constraint-Centered Search Heuristics
• Achieving domain consistency and counting solutions for dispersion constraints
• Accelerating counting-based search
• Recovering indirect solution densities for counting-based branching heuristics
• Principles and Practice of Constraint Programming – CP 2004
• More robust counting-based search heuristics with alldifferent constraints
• Potential-based bounded-cost search and anytime non-parametric A*
• Counting Solutions of Knapsack Constraints
• Counting-based search: branching heuristics for constraint satisfaction problems
• Revisiting counting solutions for the global cardinality constraint
• CSPs with counters: a likelihood-based heuristic

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 Q2272161)