Russian doll search for the Steiner triple covering problem (Q644513): Difference between revisions

@@ Property / cites work @@
+A note on some computationally difficult set covering problems
+Normal rank
@@ Property / cites work @@
+Q4256358
@@ Property / cites work: Q4256358 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4124603
@@ Property / cites work: Q4124603 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5592263
@@ Property / cites work: Q5592263 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3624109
@@ Property / cites work: Q3624109 / rank @@
+Normal rank
@@ Property / cites work @@
+A Max-SAT Inference-Based Pre-processing for Max-Clique
+Normal rank
@@ Property / cites work @@
+Classification algorithms for codes and designs
@@ Property / cites work: Classification algorithms for codes and designs / rank @@
+Normal rank
@@ Property / cites work @@
+Solving hard set covering problems
@@ Property / cites work: Solving hard set covering problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q4475653
@@ Property / cites work: Q4475653 / rank @@
+Normal rank
@@ Property / cites work @@
+Improved solutions to the Steiner triple covering problem
+Normal rank
@@ Property / cites work @@
+A fast algorithm for the maximum clique problem
@@ Property / cites work: A fast algorithm for the maximum clique problem / rank @@
+Normal rank
@@ Property / cites work @@
+Constraint Orbital Branching
@@ Property / cites work: Constraint Orbital Branching / rank @@
+Normal rank