A matheuristic approach for solving the 2-connected dominating set problem

DOI10.2298/AADM190227052JzbMath1488.90221OpenAlexW3111269231MaRDI QIDQ4989008

Stefan Voß, Raka Jovanovic

Publication date: 20 May 2021

Published in: Applicable Analysis and Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2298/aadm190227052j

zbMATH Keywords

GRASPdominating set problemmatheuristic

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Randomized algorithms (68W20)

Uses Software

• Algorithm 447

Cites Work

• On the construction of \(k\)-connected \(m\)-dominating sets in wireless networks
• A math-heuristic Dantzig-Wolfe algorithm for capacitated lot sizing
• On connected dominating sets of restricted diameter
• A heuristic approach for dividing graphs into bi-connected components with a size constraint
• On approximation algorithms of \(k\)-connected \(m\)-dominating sets in disk graphs
• On constructing \(k\)-connected \(k\)-dominating set in wireless ad hoc and sensor networks
• Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem
• An Integer Programming Approach for Fault-Tolerant Connected Dominating Sets
• Perfect and quasiperfect domination in trees
• Total Roman domination in graphs
• A Theorem on Graphs, with an Application to a Problem of Traffic Control
• Combining metaheuristics with mathematical programming, constraint programming and machine learning

This page was built for publication: A matheuristic approach for solving the 2-connected dominating set problem