Please use this identifier to cite or link to this item: https://open.uns.ac.rs/handle/123456789/10874
DC FieldValueLanguage
dc.contributor.authorGvozdenović, Nebojšaen_US
dc.contributor.authorLaurent M.en_US
dc.contributor.authorVallentin F.en_US
dc.date.accessioned2020-03-03T14:41:42Z-
dc.date.available2020-03-03T14:41:42Z-
dc.date.issued2009-01-01-
dc.identifier.issn01676377en_US
dc.identifier.urihttps://open.uns.ac.rs/handle/123456789/10874-
dc.description.abstractLová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.en
dc.relation.ispartofOperations Research Lettersen
dc.titleBlock-diagonal semidefinite programming hierarchies for 0/1 programmingen_US
dc.typeJournal/Magazine Articleen_US
dc.identifier.doi10.1016/j.orl.2008.10.003-
dc.identifier.scopus2-s2.0-58149097130-
dc.identifier.urlhttps://api.elsevier.com/content/abstract/scopus_id/58149097130-
dc.description.versionUnknownen_US
dc.relation.lastpage31en
dc.relation.firstpage27en
dc.relation.issue1en
dc.relation.volume37en
item.grantfulltextnone-
item.fulltextNo Fulltext-
crisitem.author.deptEkonomski fakultet, Departman za poslovnu informatiku i kvantitativne metode-
crisitem.author.orcid0000-0002-9230-9528-
crisitem.author.parentorgEkonomski fakultet-
Appears in Collections:EF Publikacije/Publications
Show simple item record

SCOPUSTM   
Citations

8
checked on Aug 12, 2023

Page view(s)

13
Last Week
10
Last month
0
checked on May 10, 2024

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.