Binary programming formulations for the upper domination problem
From MaRDI portal
Publication:6080758
DOI10.1007/s00186-023-00831-2arXiv2110.04987OpenAlexW3205053498MaRDI QIDQ6080758
Ryan Burdett, Michael Haythorpe, Alex Newcombe
Publication date: 25 October 2023
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2110.04987
Cites Work
- Unnamed Item
- Unnamed Item
- Computing the domination number of grid graphs
- An improved binary programming formulation for the secure domination problem
- Contributions to the theory of domination, independence and irredundance in graphs
- Unit disk graphs
- Total domination number of grid graphs
- Improved integer linear programming formulation for weak Roman domination problem
- The many facets of upper domination
- Tightness of domination inequalities for direct product graphs
- Independent sets in regular graphs
- A note on power domination in grid graphs
- Secure connected domination and secure total domination in unit disk graphs and rectangle graphs
- Defendens Imperium Romanum: A Classical Problem in Military Strategy
- The Minimum Connected Dominating Set Problem: Formulation, Valid Inequalities and a Branch-and-Cut Algorithm
- Solving the Connected Dominating Set Problem and Power Dominating Set Problem by Integer Programming
- The Domination Number of Grids
- Domination in Chessboards
- ROMAN DOMINATION AND ITS VARIANTS IN UNIT DISK GRAPHS
- Simple heuristics for unit disk graphs
- Combinatorial bounds via measure and conquer
- Improved mixed integer linear programing formulations for roman domination problem
- A theorem on tait colorings with an application to the generalized Petersen graphs
- Self-dual configurations and regular graphs
This page was built for publication: Binary programming formulations for the upper domination problem
