Exact and heuristic algorithms for the weighted total domination problem
From MaRDI portal
Publication:2027027
DOI10.1016/j.cor.2020.105157OpenAlexW3111792106MaRDI QIDQ2027027
Markus Sinnl, Eduardo Álvarez-Miranda
Publication date: 21 May 2021
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1910.03363
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Connected dominating set. Theory and applications
- Dominating communities for hierarchical control of complex networks
- A survey of selected recent results on total domination in graphs
- The Boolean quadratic polytope: Some characteristics, facets and relatives
- The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations
- Theoretical challenges towards cutting-plane selection
- The weighted independent domination problem: integer linear programming models and metaheuristic approaches
- The Benders decomposition algorithm: a literature review
- Restricted total domination in graphs
- Independent domination in graphs: A survey and recent results
- Integer linear programming models for the weighted total domination problem
- A new separation algorithm for the Boolean quadric and cut polytopes
- Optimization by GRASP
- On the Algorithmic Complexity of Total Domination
- Total domination in graphs
- Towards a theory of domination in graphs
- Total Domination in Graphs
- Location Science
- A polyhedral study of the maximum edge subgraph problem
- Different Formulations for Solving the HeaviestK-Subgraph Problem
This page was built for publication: Exact and heuristic algorithms for the weighted total domination problem
