DC FieldValueLanguage
dc.contributor.authorHansen, Pierreen
dc.contributor.authorMladenović, Nenaden
dc.contributor.authorUrošević, Draganen
dc.date.accessioned2020-05-01T20:13:58Z-
dc.date.available2020-05-01T20:13:58Z-
dc.date.issued2004-12-30en
dc.identifier.issn0166-218Xen
dc.description.abstractMaximum clique is one of the most studied NP-hard optimization problem on graphs because of its simplicity and its numerous applications. A basic variable neighborhood search heuristic for maximum clique that combines greedy with the simplicial vertex test in its descent step is proposed and tested on standard test problems from the literature. Despite its simplicity, the proposed heuristic outperforms most of the well-known approximate solution methods. Moreover, it gives solution of equal quality to those of the state-of-the-art heuristic of Battiti and Protasi in half the time.en
dc.publisherElsevier-
dc.relation.ispartofDiscrete Applied Mathematicsen
dc.subjectCombinatorial optimization | Graphs | Heuristics | Maximum clique | Variable neighborhood searchen
dc.titleVariable neighborhood search for the maximum cliqueen
dc.typeArticleen
dc.identifier.doi10.1016/j.dam.2003.09.012en
dc.identifier.scopus2-s2.0-4944245585en
dc.contributor.affiliationMathematical Institute of the Serbian Academy of Sciences and Arts-
dc.relation.firstpage117en
dc.relation.lastpage125en
dc.relation.issue1 SPEC. ISS.en
dc.relation.volume145en
dc.description.rankM22-
item.fulltextNo Fulltext-
item.openairetypeArticle-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.cerifentitytypePublications-
item.grantfulltextnone-
crisitem.author.orcid0000-0001-6655-0409-
crisitem.author.orcid0000-0003-3607-6704-
Show simple item record

SCOPUSTM   
Citations

72
checked on Nov 28, 2022

Page view(s)

37
checked on Nov 28, 2022

Google ScholarTM

Check

Altmetric

Altmetric


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