Combining semidefinite and polyhedral relaxations for integer programs (Q5101410): Difference between revisions

@@ Property / cites work @@
+A lift-and-project cutting plane algorithm for mixed 0-1 programs
+Normal rank
@@ Property / cites work @@
+Q5687247
@@ Property / cites work: Q5687247 / rank @@
+Normal rank
@@ Property / cites work @@
+Experiments in quadratic 0-1 programming
@@ Property / cites work: Experiments in quadratic 0-1 programming / rank @@
+Normal rank
@@ Property / cites work @@
+Laplacian eigenvalues and the maximum cut problem
@@ Property / cites work: Laplacian eigenvalues and the maximum cut problem / rank @@
+Normal rank
@@ Property / cites work @@
+The cut polytope and the Boolean quadric polytope
@@ Property / cites work: The cut polytope and the Boolean quadric polytope / rank @@
+Normal rank
@@ Property / cites work @@
+An Interior-Point Method for Semidefinite Programming
+Normal rank
@@ Property / cites work @@
+Quadratic knapsack relaxations using cutting planes and semidefinite programming
+Normal rank
@@ Property / cites work @@
+Connection between semidefinite relaxations of the max-cut and stable set problems
+Normal rank
@@ Property / cites work @@
+On the Shannon capacity of a graph
@@ Property / cites work: On the Shannon capacity of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Cones of Matrices and Set-Functions and 0–1 Optimization
+Normal rank