Block-diagonal semidefinite programming hierarchies for 0/1 programming

Молимо вас користите овај идентификатор за цитирање или овај линк до ове ставке: https://open.uns.ac.rs/handle/123456789/10874

Назив:	Block-diagonal semidefinite programming hierarchies for 0/1 programming
Аутори:	Gvozdenović, Nebojša Laurent M. Vallentin F.
Датум издавања:	1-јан-2009
Часопис:	Operations Research Letters
Сажетак:	Lovász 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 Lovász-Schrijver hierarchy, but less costly to compute. We report experimental results for the stable set problem of Paley graphs. © 2008 Elsevier B.V. All rights reserved.
URI:	https://open.uns.ac.rs/handle/123456789/10874
ISSN:	01676377
DOI:	10.1016/j.orl.2008.10.003
Налази се у колекцијама:	EF Publikacije/Publications