Please use this identifier to cite or link to this item:
https://open.uns.ac.rs/handle/123456789/10874| Title: | Block-diagonal semidefinite programming hierarchies for 0/1 programming | Authors: | Gvozdenović, Nebojša Laurent M. Vallentin F. |
Issue Date: | 1-Jan-2009 | Journal: | Operations Research Letters | Abstract: | 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 |
| Appears in Collections: | EF Publikacije/Publications |
Show full item record
SCOPUSTM
Citations
8
checked on Aug 12, 2023
Page view(s)
13
Last Week
10
10
Last month
0
0
checked on May 10, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.