Solving hard set covering problems (Q1924619): Difference between revisions

@@ Property / describes a project that uses @@
+DIMACS
@@ Property / describes a project that uses: DIMACS / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+A note on some computationally difficult set covering problems
+Normal rank
@@ Property / cites work @@
+A branch and bound algorithm for the maximum clique problem
+Normal rank
@@ Property / cites work @@
+Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
+Normal rank
@@ Property / cites work @@
+Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring
+Normal rank
@@ Property / cites work @@
+Finding a Maximum Clique in an Arbitrary Graph
@@ Property / cites work: Finding a Maximum Clique in an Arbitrary Graph / rank @@
+Normal rank
@@ Property / cites work @@
+Enhancing an algorithm for set covering problems
@@ Property / cites work: Enhancing an algorithm for set covering problems / rank @@
+Normal rank
@@ Property / cites work @@
+A combinatorial column generation algorithm for the maximum stable set problem
+Normal rank
@@ Property / cites work @@
+Solution of Set-Covering and Set-Partitioning Problems Using Assignment Relaxations
+Normal rank
@@ Property / cites work @@
+A probabilistic heuristic for a computationally difficult set covering problem
+Normal rank
@@ Property / cites work @@
+Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics
+Normal rank
@@ Property / cites work @@
+Q4124603
@@ Property / cites work: Q4124603 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / 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 @@
+Q5687256
@@ Property / cites work: Q5687256 / rank @@
+Normal rank
@@ Property / cites work @@
+An exact algorithm for the maximum stable set problem
+Normal rank
@@ Property / cites work @@
+A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0167-6377(95)00034-h
+Normal rank
@@ Property / OpenAlex ID @@
+W1971255318
@@ Property / OpenAlex ID: W1971255318 / rank @@
+Normal rank