On a linearization technique for solving the quadratic set covering problem and variations (Q1676486): Difference between revisions

@@ Property / cites work @@
+A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
+Normal rank
@@ Property / cites work @@
+Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
+Normal rank
@@ Property / cites work @@
+A Cutting-Plane Algorithm for the Quadratic Set-Covering Problem
+Normal rank
@@ Property / cites work @@
+Q4735035
@@ Property / cites work: Q4735035 / rank @@
+Normal rank
@@ Property / cites work @@
+A characterization of linearizable instances of the quadratic minimum spanning tree problem
+Normal rank
@@ Property / cites work @@
+Approximation of the quadratic set covering problem
+Normal rank
@@ Property / cites work @@
+Q5675139
@@ Property / cites work: Q5675139 / rank @@
+Normal rank
@@ Property / cites work @@
+Computational experience with approximation algorithms for the set covering problem
+Normal rank
@@ Property / cites work @@
+An <i>O</i>(<i>n</i><sup>4</sup>) Algorithm for the QAP Linearization Problem
+Normal rank
@@ Property / cites work @@
+Set Covering by Single-Branch Enumeration with Linear-Programming Subproblems
+Normal rank
@@ Property / cites work @@
+Compact linearization for binary quadratic problems
+Normal rank
@@ Property / cites work @@
+A linear time algorithm for the Koopmans-Beckmann QAP linearization and related problems
+Normal rank
@@ Property / cites work @@
+A Linearization technique for solving the quadratic set covering problem
+Normal rank