Solution counting algorithms for constraint-centered search heuristics
From MaRDI portal
Publication:2272161
DOI10.1007/S10601-008-9065-9zbMATH Open1192.68207OpenAlexW2605313125MaRDI QIDQ2272161FDOQ2272161
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
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
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorics in computer science (68R05) Searching and sorting (68P10)
Cites Work
- The complexity of computing the permanent
- Title not available (Why is that?)
- Principles and Practice of Constraint Programming – CP 2004
- Polynomial Time Algorithms to Approximate Permanents and Mixed Discriminants Within a Simply Exponential Factor
- A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents
- Model counting: a new stategy for obtaining good bounds
- Principles and Practice of Constraint Programming – CP 2004
- Active-constraint variable ordering for faster feasibility of mixed integer linear programs
- Solution-guided multi-point constructive search for job shop scheduling
- Approximating the permanent: A simple approach
- Principles and Practice of Constraint Programming – CP 2004
- Solution Counting Algorithms for Constraint-Centered Search Heuristics
- Exact sampling from perfect matchings of dense regular bipartite graphs
- Counting Solutions of Knapsack Constraints
- A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
- Clifford algebras and approximating the permanent
Cited In (11)
- Achieving domain consistency and counting solutions for dispersion constraints
- Counting-based search: branching heuristics for constraint satisfaction problems
- More robust counting-based search heuristics with alldifferent constraints
- Potential-based bounded-cost search and anytime non-parametric A*
- Recovering indirect solution densities for counting-based branching heuristics
- Counting Solutions of Knapsack Constraints
- Accelerating counting-based search
- Solution Counting Algorithms for Constraint-Centered Search Heuristics
- CSPs with counters: a likelihood-based heuristic
- Revisiting counting solutions for the global cardinality 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 Q2272161)
