A ``joint + marginal heuristic for 0/1 programs
From MaRDI portal
Publication:1928265
Recommendations
Cites work
- A ``joint+marginal approach to parametric polynomial optimization
- A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- An explicit equivalent positive semidefinite program for nonlinear 0-1 programs
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Global optimization with polynomials and the problem of moments
- GloptiPoly 3: moments, optimization and semidefinite programming
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Integrality gaps of linear and semi-definite programming relaxations for knapsack
- Persistence in discrete optimization under data uncertainty
- Persistency in 0-1 polynomial programming
- Persistency model and its applications in choice modeling
- Semidefinite Programming vs. LP Relaxations for Polynomial Programming
Cited in
(2)
This page was built for publication: A ``joint + marginal heuristic for 0/1 programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1928265)