Please use this identifier to cite or link to this item:
https://open.uns.ac.rs/handle/123456789/10874
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Gvozdenović, Nebojša | en_US |
dc.contributor.author | Laurent M. | en_US |
dc.contributor.author | Vallentin F. | en_US |
dc.date.accessioned | 2020-03-03T14:41:42Z | - |
dc.date.available | 2020-03-03T14:41:42Z | - |
dc.date.issued | 2009-01-01 | - |
dc.identifier.issn | 01676377 | en_US |
dc.identifier.uri | https://open.uns.ac.rs/handle/123456789/10874 | - |
dc.description.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. | en |
dc.relation.ispartof | Operations Research Letters | en |
dc.title | Block-diagonal semidefinite programming hierarchies for 0/1 programming | en_US |
dc.type | Journal/Magazine Article | en_US |
dc.identifier.doi | 10.1016/j.orl.2008.10.003 | - |
dc.identifier.scopus | 2-s2.0-58149097130 | - |
dc.identifier.url | https://api.elsevier.com/content/abstract/scopus_id/58149097130 | - |
dc.description.version | Unknown | en_US |
dc.relation.lastpage | 31 | en |
dc.relation.firstpage | 27 | en |
dc.relation.issue | 1 | en |
dc.relation.volume | 37 | en |
item.grantfulltext | none | - |
item.fulltext | No Fulltext | - |
crisitem.author.dept | Ekonomski fakultet, Departman za poslovnu informatiku i kvantitativne metode | - |
crisitem.author.orcid | 0000-0002-9230-9528 | - |
crisitem.author.parentorg | Ekonomski fakultet | - |
Appears in Collections: | EF Publikacije/Publications |
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.