Satisfiability testing of Boolean combinations of pseudo-Boolean constraints using local-search techniques (Q2385178): Difference between revisions

@@ Property / describes a project that uses @@
+BerkMin
@@ Property / describes a project that uses: BerkMin / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10601-007-9022-z
+Normal rank
@@ Property / OpenAlex ID @@
+W1994152502
@@ Property / OpenAlex ID: W1994152502 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4942636
@@ Property / cites work: Q4942636 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4797424
@@ Property / cites work: Q4797424 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+BerkMin: A fast and robust SAT-solver
@@ Property / cites work: BerkMin: A fast and robust SAT-solver / rank @@
+Normal rank
@@ Property / cites work @@
+Q5472387
@@ Property / cites work: Q5472387 / rank @@
+Normal rank
@@ Property / cites work @@
+Principles and Practice of Constraint Programming – CP 2003
+Normal rank
@@ Property / cites work @@
+Q3429158
@@ Property / cites work: Q3429158 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4386960
@@ Property / cites work: Q4386960 / rank @@
+Normal rank