Solution Counting Algorithms for Constraint-Centered Search Heuristics (Q3523086): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-540-74970-7_52
+Normal rank
@@ Property / OpenAlex ID @@
+W2036975612
@@ Property / OpenAlex ID: W2036975612 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4705350
@@ Property / cites work: Q4705350 / rank @@
+Normal rank
@@ Property / cites work @@
+Clifford algebras and approximating the permanent
@@ Property / cites work: Clifford algebras and approximating the permanent / rank @@
+Normal rank
@@ Property / cites work @@
+Q5740444
@@ Property / cites work: Q5740444 / rank @@
+Normal rank
@@ Property / cites work @@
+Exact sampling from perfect matchings of dense regular bipartite graphs
+Normal rank
@@ Property / cites work @@
+A polynomial-time approximation algorithm for the permanent of a matrix with  non-negative entries
+Normal rank
@@ Property / cites work @@
+A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents
+Normal rank
@@ Property / cites work @@
+Principles and Practice of Constraint Programming – CP 2004
+Normal rank
@@ Property / cites work @@
+Active-constraint variable ordering for faster feasibility of mixed integer linear programs
+Normal rank
@@ Property / cites work @@
+Principles and Practice of Constraint Programming – CP 2004
+Normal rank
@@ Property / cites work @@
+Approximating the permanent: A simple approach
@@ Property / cites work: Approximating the permanent: A simple approach / rank @@
+Normal rank
@@ Property / cites work @@
+Principles and Practice of Constraint Programming – CP 2004
+Normal rank
@@ Property / cites work @@
+The complexity of computing the permanent
@@ Property / cites work: The complexity of computing the permanent / rank @@
+Normal rank