Set covering approach for reconstruction of sibling relationships (Q5758164): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1080/10556780600881829
+Normal rank
@@ Property / OpenAlex ID @@
+W2015201000
@@ Property / OpenAlex ID: W2015201000 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3037131
@@ Property / cites work: Q3037131 / rank @@
+Normal rank
@@ Property / cites work @@
+A Guaranteed-Accuracy Round-off Algorithm for Cyclic Scheduling and Set Covering
+Normal rank
@@ Property / cites work @@
+A Lagrangean Relaxation Algorithm for the Two Duty Period Scheduling Problem
+Normal rank
@@ Property / cites work @@
+The Location of Emergency Service Facilities
@@ Property / cites work: The Location of Emergency Service Facilities / rank @@
+Normal rank
@@ Property / cites work @@
+Simplification of the Covering Problem with Application to Boolean Expressions
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for the set covering problem
@@ Property / cites work: Algorithms for the set covering problem / rank @@
+Normal rank
@@ Property / cites work @@
+A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set Covering
+Normal rank
@@ Property / cites work @@
+Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
+Normal rank
@@ Property / cites work @@
+On the set covering polytope. I: All the facets with coefficients in \(\{\) 0,1,2\(\}\)
+Normal rank
@@ Property / cites work @@
+On the set covering polytope. II: Lifting the facets with coefficients in \(\{\) 0,1,2\(\}\)
+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 @@
+Solving hard set covering problems
@@ Property / cites work: Solving hard set covering problems / rank @@
+Normal rank
@@ Property / cites work @@
+A Greedy Heuristic for the Set-Covering Problem
@@ Property / cites work: A Greedy Heuristic for the Set-Covering Problem / rank @@
+Normal rank
@@ Property / cites work @@
+An algorithm for set covering problem
@@ Property / cites work: An algorithm for set covering problem / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics
+Normal rank
@@ Property / cites work @@
+Q4735035
@@ Property / cites work: Q4735035 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4859572
@@ Property / cites work: Q4859572 / rank @@
+Normal rank
@@ Property / cites work @@
+Computational experience with approximation algorithms for the set covering problem
+Normal rank
@@ Property / cites work @@
+A genetic algorithm for the set covering problem
@@ Property / cites work: A genetic algorithm for the set covering problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q4494414
@@ Property / cites work: Q4494414 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2712334
@@ Property / cites work: Q2712334 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4217266
@@ Property / cites work: Q4217266 / rank @@
+Normal rank
@@ Property / cites work @@
+A threshold of ln             <i>n</i>             for approximating set cover
+Normal rank
@@ Property / cites work @@
+Non-approximability results for optimization problems on bounded degree instances
+Normal rank
@@ Property / cites work @@
+Approximability of hard combinatorial optimization problems: an introduction
+Normal rank
@@ Property / cites work @@
+Partition-distance: A problem and class of perfect graphs arising in clustering
+Normal rank
@@ Property / cites work @@
+Q4371290
@@ Property / cites work: Q4371290 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:5758164