DC FieldValueLanguage
dc.contributor.authorMladenović, Nenaden
dc.contributor.authorUrošević, Draganen
dc.contributor.authorPérez-Brit, Dionisioen
dc.date.accessioned2020-05-01T20:13:54Z-
dc.date.available2020-05-01T20:13:54Z-
dc.date.issued2016-01-01en
dc.identifier.issn0354-0243en
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/1777-
dc.description.abstractThe minimum linear arrangement problem is widely used and studied in many practical and theoretical applications. It consists of finding an embedding of the nodes of a graph on the line such that the sum of the resulting edge lengths is minimized. This problem is one among the classical NP-hard optimization problems and therefore, there has been extensive research on exact and approximative algorithms. In this paper we present an implementation of a variable neighborhood search (VNS) for solving minimum linear arrangement problem. We use Skewed general VNS scheme witch appeared to be successful in solving some recent optimization problems on graphs. Based on computational experiments, we argue that our approach is comparable with the state-of-the-art heuristic.en
dc.publisherFaculty of Organizational Sciences, University of Belgrade-
dc.relationRSF grant 14-41-00039-
dc.relationGobierno de Canarias grant SolSubC200801000048-
dc.relation.ispartofYugoslav Journal of Operations Researchen
dc.subjectGraphs | Minimum linear arrangement problem | Optimization | Variable neighborhood searchen
dc.titleVariable neighborhood search for minimum linear arrangement problemen
dc.typeArticleen
dc.identifier.doi10.2298/YJOR140928038Men
dc.identifier.scopus2-s2.0-84963745866en
dc.relation.firstpage3en
dc.relation.lastpage14en
dc.relation.issue1en
dc.relation.volume26en
dc.description.rankM51-
item.cerifentitytypePublications-
item.openairetypeArticle-
item.fulltextNo Fulltext-
item.grantfulltextnone-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
crisitem.author.orcid0000-0001-6655-0409-
crisitem.author.orcid0000-0003-3607-6704-
Show simple item record

SCOPUSTM   
Citations

8
checked on Jul 12, 2024

Page view(s)

56
checked on May 9, 2024

Google ScholarTM

Check

Altmetric

Altmetric


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