Variable neighborhood search-based heuristics for MIN-power symmetric connectivity problem in wireless networks

DOI10.1007/978-3-319-44914-2_18zbMATH Open1385.90005OpenAlexW2559284960WikidataQ62048755 ScholiaQ62048755MaRDI QIDQ3133215FDOQ3133215

Authors: Roman Plotnikov, A. I. Erzin, Nenad Mladenović 

Publication date: 13 February 2018

Published in: Discrete Optimization and Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-44914-2_18

Recommendations

• Variable neighborhood search variants for min-power symmetric connectivity problem
• Exact algorithms for the minimum power symmetric connectivity problem in wireless networks
• Using VNS for the optimal synthesis of the communication tree in wireless sensor networks
• A Branch-and-Cut Algorithm for the Minimum Energy Symmetric Connectivity Problem in Wireless Networks
• Parameterized Algorithms for Power-Efficiently Connecting Wireless Sensor Networks: Theory and Experiments

zbMATH Keywords

energy efficiencyvariable neighborhood searchwireless sensor networksNP-hard problem

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)

Cited In (4)

• Exact algorithms for the minimum power symmetric connectivity problem in wireless networks
• Variable neighborhood search variants for min-power symmetric connectivity problem
• Aggregation tree construction using hierarchical structures
• Using VNS for the optimal synthesis of the communication tree in wireless sensor networks

This page was built for publication: Variable neighborhood search-based heuristics for MIN-power symmetric connectivity problem in wireless networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3133215)