The equivalence of semidefinite relaxations of polynomial 0-1 and 1 programs via scaling
From MaRDI portal
Publication:943789
DOI10.1016/J.ORL.2007.10.006zbMATH Open1152.90555OpenAlexW1988044523MaRDI QIDQ943789FDOQ943789
Authors: Kevin K. H. Cheung 
Publication date: 10 September 2008
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2007.10.006
Recommendations
- scientific article; zbMATH DE number 1757962
- An explicit equivalent positive semidefinite program for nonlinear 0-1 programs
- A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming
- Fixed point theory for permissible extension type maps
- Combining semidefinite and polyhedral relaxations for integer programs
Cites Work
- An explicit equivalent positive semidefinite program for nonlinear 0-1 programs
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- Cones of Matrices and Set-Functions and 0–1 Optimization
- A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming
- Lower Bound for the Number of Iterations in Semidefinite Hierarchies for the Cut Polytope
- Fixing Variables in Semidefinite Relaxations
- Hadamard determinants Möbius functions, and the chromatic number of a graph
- Connection between semidefinite relaxations of the max-cut and stable set problems
- Tighter linear and semidefinite relaxations for max-cut based on the Lovász-Schrijver lift-and-project procedure
Cited In (4)
This page was built for publication: The equivalence of semidefinite relaxations of polynomial 0-1 and \(\pm 1\) programs via scaling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q943789)
