The equivalence of semidefinite relaxations of polynomial 0-1 and \(\pm 1\) programs via scaling
type: Item
instance of: scholarly article
title: The equivalence of semidefinite relaxations of polynomial 0-1 and \(\pm 1\) programs via scaling
zbMATH Open document ID: 1152.90555
author: Kevin K. H. Cheung
published in: Operations Research Letters
publication date: 2008-09-10T00:00:00Z
Mathematics Subject Classification ID: 90C22
Mathematics Subject Classification ID: 90C09
zbMATH DE Number: 5324080
zbMATH Keywords: semidefinite programming
zbMATH Keywords: binary programming
zbMATH Keywords: equivalent relaxation
zbMATH Keywords: scaling
MaRDI profile type: Publication
full work available at URL: j.orl.2007.10.006
OpenAlex ID: W1988044523
cites work: Fixing Variables in Semidefinite Relaxations
cites work: An explicit equivalent positive semidefinite program for nonlinear 0-1 programs
cites work: A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming
cites work: Lower Bound for the Number of Iterations in Semidefinite Hierarchies for the Cut Polytope
cites work: Tighter linear and semidefinite relaxations for max-cut based on the Lovász-Schrijver lift-and-project procedure
cites work: Connection between semidefinite relaxations of the max-cut and stable set problems
cites work: Cones of Matrices and Set-Functions and 0–1 Optimization
cites work: A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
cites work: Hadamard determinants Möbius functions, and the chromatic number of a graph
DOI: 10.1016/J.ORL.2007.10.006
description: scientific article; zbMATH DE number 5324080