An improved binary programming formulation for the secure domination problem

DOI10.1007/s10479-020-03810-6zbMath1462.05273arXiv1911.02198OpenAlexW3088670687MaRDI QIDQ828823

Ryan Burdett, Michael Haythorpe

Publication date: 5 May 2021

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1911.02198

zbMATH Keywords

formulationsecure dominationbinary programmingsecure connected

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (3)

Binary programming formulations for the upper domination problem ⋮ Correcting the algorithm for the secure domination number of cographs by Jha, Pradhan, and Banerjee ⋮ The secure domination number of Cartesian products of small graphs with paths and cycles

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Exact algorithms for dominating set
• Optimization of wireless sensor networks deployment with coverage and connectivity constraints
• On the secure domination numbers of maximal outerplanar graphs
• On computing a minimum secure dominating set in block graphs
• The complexity of secure domination problem in graphs
• On secure domination in graphs
• Complexity issues of variants of secure domination in graphs
• A linear algorithm for secure domination in trees
• Solving the Connected Dominating Set Problem and Power Dominating Set Problem by Integer Programming
• Integer Programming Formulation of Traveling Salesman Problems
• A theorem on tait colorings with an application to the generalized Petersen graphs

This page was built for publication: An improved binary programming formulation for the secure domination problem