A ``joint + marginal'' heuristic for 0/1 programs (Q1928265): Difference between revisions

@@ Property / cites work @@
+Persistency in 0-1 Polynomial Programming
@@ Property / cites work: Persistency in 0-1 Polynomial Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Persistence in discrete optimization under data uncertainty
+Normal rank
@@ Property / cites work @@
+Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
+Normal rank
@@ Property / cites work @@
+GloptiPoly 3: moments, optimization and semidefinite programming
+Normal rank
@@ Property / cites work @@
+Global Optimization with Polynomials and the Problem of Moments
+Normal rank
@@ Property / cites work @@
+An Explicit Equivalent Positive Semidefinite Program for Nonlinear 0-1 Programs
+Normal rank
@@ Property / cites work @@
+Semidefinite Programming vs. LP Relaxations for Polynomial Programming
+Normal rank
@@ Property / cites work @@
+A “Joint+Marginal” Approach to Parametric Polynomial Optimization
+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 @@
+Cones of Matrices and Set-Functions and 0–1 Optimization
+Normal rank
@@ Property / cites work @@
+Integrality Gaps of Linear and Semi-Definite Programming Relaxations for Knapsack
+Normal rank
@@ Property / cites work @@
+Persistency Model and Its Applications in Choice Modeling
+Normal rank
@@ Property / cites work @@
+A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
+Normal rank