Block-diagonal semidefinite programming hierarchies for 0/1 programming

Authors:
NebojšA Gvozdenović;Monique Laurent;Frank Vallentin
Affiliations:
The Faculty of Economics, University of Novi Sad, Segedinski put 9-11, 24000 Subotica, Serbia;Centrum voor Wiskunde en Informatica (CWI), Kruislaan 413, 1098 SJ Amsterdam, The Netherlands;Centrum voor Wiskunde en Informatica (CWI), Kruislaan 413, 1098 SJ Amsterdam, The Netherlands
Venue:
Operations Research Letters
Year:
2009

Citing 9
Cited 0

A hierarchy of relaxation between the continuous and convex hull representations

SIAM Journal on Discrete Mathematics
A lift-and-project cutting plane algorithm for mixed 0-1 programs

Mathematical Programming: Series A and B
An Explicit Equivalent Positive Semidefinite Program for Nonlinear 0-1 Programs

SIAM Journal on Optimization
A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0--1 Programming

Mathematics of Operations Research
Strengthened semidefinite programming bounds for codes

Mathematical Programming: Series A and B
A note on the stability number of an orthogonality graph

European Journal of Combinatorics
The Operator $\Psi$ for the Chromatic Number of a Graph

SIAM Journal on Optimization
Computing Semidefinite Programming Lower Bounds for the (Fractional) Chromatic Number Via Block-Diagonalization

SIAM Journal on Optimization
On the Shannon capacity of a graph

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

Lovasz and Schrijver, and later Lasserre, proposed hierarchies of semidefinite programming relaxations for 0/1 linear programming problems. We revisit these two constructions and propose two new, block-diagonal hierarchies, which are at least as strong as the Lovasz-Schrijver hierarchy, but less costly to compute. We report experimental results for the stable set problem of Paley graphs.