Branch \& Sample: A simple strategy for constraint satisfaction (Q1123646): Difference between revisions

@@ Property / cites work @@
+Q4144192
@@ Property / cites work: Q4144192 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3856120
@@ Property / cites work: Q3856120 / rank @@
+Normal rank
@@ Property / cites work @@
+Branch-and-Bound Methods: A Survey
@@ Property / cites work: Branch-and-Bound Methods: A Survey / rank @@
+Normal rank
@@ Property / cites work @@
+General branch and bound, and its relation to \(A^*\) and \(AO^*\)
+Normal rank
@@ Property / cites work @@
+Backtrack programming techniques
@@ Property / cites work: Backtrack programming techniques / rank @@
+Normal rank
@@ Property / cites work @@
+Consistency in networks of relations
@@ Property / cites work: Consistency in networks of relations / rank @@
+Normal rank
@@ Property / cites work @@
+A Sufficient Condition for Backtrack-Free Search
@@ Property / cites work: A Sufficient Condition for Backtrack-Free Search / rank @@
+Normal rank
@@ Property / cites work @@
+A sufficient condition for backtrack-bounded search
+Normal rank
@@ Property / cites work @@
+Combinatorially implosive algorithms
@@ Property / cites work: Combinatorially implosive algorithms / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bf02219227
+Normal rank
@@ Property / OpenAlex ID @@
+W2052729468
@@ Property / OpenAlex ID: W2052729468 / rank @@
+Normal rank