A Linearization technique for solving the quadratic set covering problem (Q4331991): Difference between revisions

@@ Property / author @@
+Ratnesh Rajan Saxena
@@ Property / author: Ratnesh Rajan Saxena / rank @@
+Normal rank
@@ Property / author @@
+Sant R. Arora
@@ Property / author: Sant R. Arora / 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.1080/02331939708844269
+Normal rank
@@ Property / OpenAlex ID @@
+W2034831675
@@ Property / OpenAlex ID: W2034831675 / rank @@
+Normal rank
@@ Property / cites work @@
+Enumeration Technique for the Set Covering Problem with a Linear Fractional Functional as its Objective Function
+Normal rank
@@ Property / cites work @@
+A Cutting-Plane Algorithm for the Quadratic Set-Covering Problem
+Normal rank
@@ Property / cites work @@
+Q3214706
@@ Property / cites work: Q3214706 / rank @@
+Normal rank
@@ Property / cites work @@
+Set Covering by Single-Branch Enumeration with Linear-Programming Subproblems
+Normal rank
@@ Property / cites work @@
+Computer Solutions to Minimum-Cover Problems
@@ Property / cites work: Computer Solutions to Minimum-Cover Problems / rank @@
+Normal rank