Show simple item record

dc.contributor.authorGrosso, Andreaen_US
dc.contributor.authorLocatelli, Marcoen_US
dc.contributor.authorPullan, Wayneen_US
dc.date.accessioned2017-05-03T13:58:13Z
dc.date.available2017-05-03T13:58:13Z
dc.date.issued2008en_US
dc.date.modified2010-08-30T06:59:31Z
dc.identifier.issn15729397en_US
dc.identifier.doi10.1007/s10732-007-9055-xen_AU
dc.identifier.urihttp://hdl.handle.net/10072/19041
dc.description.abstractStarting from an algorithm recently proposed by Pullan and Hoos, we formulate and analyze iterated local search algorithms for the maximum clique problem. The basic components of such algorithms are a fast neighbourhood search (not based on node evaluation but on completely random selection) and simple, yet very effective, diversification techniques and restart rules. A detailed computational study is performed in order to identify strengths and weaknesses of the proposed algorithms and the role of the different components on several classes of instances. The tested algorithms are very fast and reliable: most of the DIMACS benchmark instances are solved within very short CPU times. For one of the hardest tests, a new putative optimum was discovered by one of our algorithms. Very good performances were also shown on recently proposed and more difficult instances. It is important to remark that the heuristics tested in this paper are basically parameter free (the appropriate value for the unique parameter is easily identified and was, in fact, the same value for all problem instances used in this paper).en_US
dc.description.peerreviewedYesen_US
dc.description.publicationstatusYesen_AU
dc.languageEnglishen_US
dc.language.isoen_AU
dc.publisherSpringeren_US
dc.publisher.placeNetherlandsen_US
dc.relation.ispartofstudentpublicationNen_AU
dc.relation.ispartofpagefrom587en_US
dc.relation.ispartofpageto612en_US
dc.relation.ispartofissue6en_US
dc.relation.ispartofjournalJournal of Heuristicsen_US
dc.relation.ispartofvolume14en_US
dc.rights.retentionYen_AU
dc.subject.fieldofresearchcode289999en_US
dc.titleSimple ingredients leading to very efficient heuristics for the maximum clique problemen_US
dc.typeJournal articleen_US
dc.type.descriptionC1 - Peer Reviewed (HERDC)en_US
dc.type.codeC - Journal Articlesen_US
gro.date.issued2008
gro.hasfulltextNo Full Text


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

  • Journal articles
    Contains articles published by Griffith authors in scholarly journals.

Show simple item record