Solution Counting Algorithms for Constraint-Centered Search Heuristics
From MaRDI portal
Publication:3523086
DOI10.1007/978-3-540-74970-7_52zbMath1145.68536MaRDI QIDQ3523086
Gilles Pesant, Alessandro Zanarini
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
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
Related Items
Counting Solutions of Knapsack Constraints, The weighted grammar constraint, Solution counting algorithms for constraint-centered search heuristics
Cites Work
- Unnamed Item
- Unnamed Item
- The complexity of computing the permanent
- Active-constraint variable ordering for faster feasibility of mixed integer linear programs
- Exact sampling from perfect matchings of dense regular bipartite graphs
- Approximating the permanent: A simple approach
- A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries
- Principles and Practice of Constraint Programming – CP 2004
- Principles and Practice of Constraint Programming – CP 2004
- Principles and Practice of Constraint Programming – CP 2004
- Clifford algebras and approximating the permanent
- A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents