Variable neighborhood search variants for Min-power symmetric connectivity problem

Variable neighborhood search variants for Min-power symmetric connectivity problem Full article

Journal

Computers and Operations Research
ISSN: 0305-0548 , E-ISSN: 1873-765X

Output data

Year: 2017, Volume: 78, Pages: 557-563 Pages count : 7 DOI: 10.1016/j.cor.2016.05.010

Tags

Energy efficiency; NP-hard problem; Variable neighborhood search; Wireless sensor network

Authors

Erzin A.I. ^1,2 , Mladenovic N. ^2,3 , Plotnikov R.V. ¹

Affiliations

1	Sobolev Institute of Mathematics
2	Novosibirsk State University
3	Polytechnic University of Hauts-de-France

Erzin A.I. , Mladenovic N. , Plotnikov R.V.
Variable neighborhood search variants for Min-power symmetric connectivity problem
Computers and Operations Research. 2017. V.78. P.557-563. DOI: 10.1016/j.cor.2016.05.010 WOS Scopus OpenAlex

Web of science:	WOS:000390071400047
Scopus:	2-s2.0-84973532114
OpenAlex:	W2400161841

DB	Citing
Scopus	13
OpenAlex	13
Web of science	6