DC FieldValueLanguage
dc.contributor.authorHansen, Pierreen
dc.contributor.authorMladenović, Nenaden
dc.date.accessioned2020-05-02T16:42:16Z-
dc.date.available2020-05-02T16:42:16Z-
dc.date.issued2002-12-01en
dc.identifier.isbn978-1-4615-1507-4-
dc.identifier.issn1387-666Xen
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/2555-
dc.description.abstractProposed just a few years ago, Variable Neighborhood Search (VNS) is a new metaheuristic for combinatorial and global optimization, based upon systematic change of neighborhood within a possibly randomized local search. Its development has been rapid. After reviewing the basic scheme of VNS, several extensions aimed at solving large problem instances are surveyed. Issues in devising a VNS heuristic are discussed. Finally, recent applications are briefly summarized, with special attention given to VNS-based computer-aided discovery of conjectures in graph theory.en
dc.publisherSpringer Link-
dc.relation.ispartofOperations Research : Computer Science Interfaces Seriesen
dc.titleDevelopments of variable neighborhood searchen
dc.typeArticleen
dc.identifier.doi10.1007/978-1-4615-1507-4_19en
dc.identifier.scopus2-s2.0-84888808218en
dc.contributor.affiliationMathematical Institute of the Serbian Academy of Sciences and Arts-
dc.relation.firstpage415en
dc.relation.lastpage439en
dc.relation.volume15en
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.openairetypeArticle-
item.cerifentitytypePublications-
item.fulltextNo Fulltext-
item.grantfulltextnone-
crisitem.author.orcid0000-0001-6655-0409-
Show simple item record

SCOPUSTM   
Citations

59
checked on Nov 24, 2024

Page view(s)

25
checked on Nov 24, 2024

Google ScholarTM

Check

Altmetric

Altmetric


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