Solving large Steiner Triple Covering Problems (Q2275579): Difference between revisions

@@ Property / cites work @@
+A note on some computationally difficult set covering problems
+Normal rank
@@ Property / cites work @@
+A probabilistic heuristic for a computationally difficult set covering problem
+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 @@
+An interior point algorithm to solve computationally difficult set covering problems
+Normal rank
@@ Property / cites work @@
+Reformulations in mathematical programming: automatic symmetry detection and exploitation
+Normal rank
@@ Property / cites work @@
+Solving hard set covering problems
@@ Property / cites work: Solving hard set covering problems / rank @@
+Normal rank
@@ Property / cites work @@
+Pruning by isomorphism in branch-and-cut
@@ Property / cites work: Pruning by isomorphism in branch-and-cut / rank @@
+Normal rank
@@ Property / cites work @@
+Russian doll search for the Steiner triple covering problem
+Normal rank
@@ Property / cites work @@
+Orbital branching
@@ Property / cites work: Orbital branching / rank @@
+Normal rank
@@ Property / cites work @@
+Improved solutions to the Steiner triple covering problem
+Normal rank
@@ Property / cites work @@
+Constraint Orbital Branching
@@ Property / cites work: Constraint Orbital Branching / rank @@
+Normal rank