DC FieldValueLanguage
dc.contributor.authorErzin, Adilen
dc.contributor.authorMladenović, Nenaden
dc.contributor.authorPlotnikov, Romanen
dc.date.accessioned2020-05-02T16:41:57Z-
dc.date.available2020-05-02T16:41:57Z-
dc.date.issued2017-02-01en
dc.identifier.issn0305-0548en
dc.description.abstractWe consider the problem of optimal communication tree construction in a given undirected weighted graph. Such a problem occurs while minimizing the power consumption of data transmission in different distributed networks in the case when network elements are able to adjust their transmission ranges. In this paper, the most general strongly NP-hard formulation, when edge weights have arbitrary non-negative values, is considered. We propose new heuristics, mostly based on variable neighborhood search, for getting an approximate solution of the problem. Extensive comparative analysis between the proposed methods was performed. Numerical experiments demonstrated the high efficiency of the proposed heuristics.en
dc.publisherElsevier-
dc.relationRussian Foundation for Basic Research (Grant no. 16-07-00552)-
dc.relationMinistry of Education and Science, Republic of Kazakhstan (Project no. 0115PK00546 )-
dc.relation.ispartofComputers and Operations Researchen
dc.subjectEnergy efficiency | NP-hard problem | Variable neighborhood search | Wireless sensor networken
dc.titleVariable neighborhood search variants for Min-power symmetric connectivity problemen
dc.typeArticleen
dc.identifier.doi10.1016/j.cor.2016.05.010en
dc.identifier.scopus2-s2.0-84973532114en
dc.relation.firstpage557en
dc.relation.lastpage563en
dc.relation.volume78en
dc.description.rankM21-
item.fulltextNo Fulltext-
item.openairetypeArticle-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.cerifentitytypePublications-
item.grantfulltextnone-
crisitem.author.orcid0000-0001-6655-0409-
Show simple item record

SCOPUSTM   
Citations

11
checked on Nov 27, 2022

Page view(s)

31
checked on Nov 28, 2022

Google ScholarTM

Check

Altmetric

Altmetric


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