A ``joint + marginal heuristic for 0/1 programs

DOI10.1007/s10898-011-9788-9zbMath1257.90051OpenAlexW2078167809MaRDI QIDQ1928265

Tung Phan Thanh, Jean-Bernard Lasserre

Publication date: 3 January 2013

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-011-9788-9

zbMATH Keywords

semidefinite relaxations0/1 Programs

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Boolean programming (90C09)

Uses Software

• GloptiPoly

Cites Work

• Persistence in discrete optimization under data uncertainty
• Global Optimization with Polynomials and the Problem of Moments
• Persistency in 0-1 Polynomial Programming
• An Explicit Equivalent Positive Semidefinite Program for Nonlinear 0-1 Programs
• Integrality Gaps of Linear and Semi-Definite Programming Relaxations for Knapsack
• A “Joint+Marginal” Approach to Parametric Polynomial Optimization
• Persistency Model and Its Applications in Choice Modeling
• A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
• GloptiPoly 3: moments, optimization and semidefinite programming
• Cones of Matrices and Set-Functions and 0–1 Optimization
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• Semidefinite Programming vs. LP Relaxations for Polynomial Programming
• A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming

This page was built for publication: A ``joint + marginal heuristic for 0/1 programs