Restricted swap-based neighborhood search for the minimum connected dominating set problem

DOI10.1002/NET.21728zbMATH Open1390.90128OpenAlexW2579139197MaRDI QIDQ4565786FDOQ4565786

Xinyun Wu, P. Galinier, Zhipeng Lü

Publication date: 13 June 2018

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.21728

Recommendations

• A matheuristic approach for solving the 2-connected dominating set problem
• A decomposition approach for the minimum connected dominating set problem
• Benders decomposition, branch-and-cut, and hybrid algorithms for the minimum connected dominating set problem
• Multi-start iterated tabu search for the minimum weight vertex cover problem
• A Hybrid Algorithm Based on Tabu Search and Ant Colony Optimization for k-Minimum Spanning Tree Problems

zbMATH Keywords

optimizationtabu searchmeta-heuristicperturbation operatorconnected dominating setswap-based neighborhood structure

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Connectivity (05C40) Communication networks in operations research (90B18)

Cited In (4)

• Efficient Local Search based on Dynamic Connectivity Maintenance for Minimum Connected Dominating Set
• A Fast Vertex Weighting-Based Local Search for Finding Minimum Connected Dominating Sets
• Solving Steiner trees: Recent advances, challenges, and perspectives
• A novel local search approach with connected dominating degree-based incremental neighborhood evaluation for the minimum 2-connected dominating set problem

This page was built for publication: Restricted swap-based neighborhood search for the minimum connected dominating set problem

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