The equivalence of semidefinite relaxations of polynomial 0-1 and \(\pm 1\) programs via scaling (Q943789): Difference between revisions

@@ Property / DOI @@
-.1016/j.orl.2007.10.006
@@ Property / DOI: 10.1016/j.orl.2007.10.006 / rank @@
-Normal rank
@@ Property / cites work @@
+Fixing Variables in Semidefinite Relaxations
@@ Property / cites work: Fixing Variables in Semidefinite Relaxations / rank @@
+Normal rank
@@ Property / cites work @@
+An Explicit Equivalent Positive Semidefinite Program for Nonlinear 0-1 Programs
+Normal rank
@@ Property / cites work @@
+A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming
+Normal rank
@@ Property / cites work @@
+Lower Bound for the Number of Iterations in Semidefinite Hierarchies for the Cut Polytope
+Normal rank
@@ Property / cites work @@
+Tighter Linear and Semidefinite Relaxations for Max-Cut Based on the Lovász--Schrijver Lift-and-Project Procedure
+Normal rank
@@ Property / cites work @@
+Connection between semidefinite relaxations of the max-cut and stable set problems
+Normal rank
@@ Property / cites work @@
+Cones of Matrices and Set-Functions and 0–1 Optimization
+Normal rank
@@ Property / cites work @@
+A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
+Normal rank
@@ Property / cites work @@
+Hadamard determinants Möbius functions, and the chromatic number of a graph
+Normal rank
@@ Property / DOI @@
+.1016/J.ORL.2007.10.006
@@ Property / DOI: 10.1016/J.ORL.2007.10.006 / rank @@
+Normal rank