Variable neighborhood search variants for min-power symmetric connectivity problem

DOI10.1016/j.cor.2016.05.010zbMath1391.90654OpenAlexW2400161841WikidataQ62048751 ScholiaQ62048751MaRDI QIDQ1652130

R. V. Plotnikov, Nenad Mladenović, Adil I. Erzin

Publication date: 11 July 2018

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2016.05.010

zbMATH Keywords

variable neighborhood searchNP-hard problemwireless sensor networkenergy efficiency

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (3)

Parameterized Algorithms for Power-Efficient Connected Symmetric Wireless Sensor Networks ⋮ Parameterized Algorithms for Power-Efficiently Connecting Wireless Sensor Networks: Theory and Experiments ⋮ A Local Search Algorithm for the Single Machine Scheduling Problem with Setups and a Storage

Cites Work

• Power assignment in radio networks with two power levels
• Power consumption in packet radio networks
• Variable neighborhood search for the vertex weighted \(k\)-cardinality tree problem
• Using VNS for the optimal synthesis of the communication tree in wireless sensor networks
• ENERGY-EFFICIENT NODE SCHEDULING MODELS IN SENSOR NETWORKS WITH ADJUSTABLE RANGES
• On some polynomially solvable cases and approximate algorithms in the optimal communication tree construction problem
• New variable neighbourhood search based 0-1 MIP heuristics
• Variable neighborhood search: Principles and applications

This page was built for publication: Variable neighborhood search variants for min-power symmetric connectivity problem