Lift-and-project ranks of the set covering polytope of circulant matrices (Q1759829): Difference between revisions

@@ Property / cites work @@
+On packing and covering polyhedra of consecutive ones circulant clutters
+Normal rank
@@ Property / cites work @@
+On the set covering polyhedron of circulant matrices
+Normal rank
@@ Property / cites work @@
+The nonidealness index of rank-ideal matrices
@@ Property / cites work: The nonidealness index of rank-ideal matrices / rank @@
+Normal rank
@@ Property / cites work @@
+A lift-and-project cutting plane algorithm for mixed 0-1 programs
+Normal rank
@@ Property / cites work @@
+On the behavior of the \(N_{+}\)-operator under blocker duality
+Normal rank
@@ Property / cites work @@
+Ideal 0, 1 matrices
@@ Property / cites work: Ideal 0, 1 matrices / rank @@
+Normal rank
@@ Property / cites work @@
+Worst-case comparison of valid inequalities for the TSP
+Normal rank
@@ Property / cites work @@
+The stable set problem and the lift-and-project ranks of graphs
+Normal rank
@@ Property / cites work @@
+Cones of Matrices and Set-Functions and 0–1 Optimization
+Normal rank
@@ Property / cites work @@
+On the facial structure of the set covering polytope
+Normal rank
@@ Property / cites work @@
+Polyhedral and semidefinite programming methods in combinatorial optimization
+Normal rank