Exact and heuristic algorithms for the weighted total domination problem
From MaRDI portal
Publication:6326760
DOI10.1016/j.cor.2020.105157zbMath1510.90274arXiv1910.03363MaRDI QIDQ6326760
Eduardo Álvarez-Miranda, Markus Sinnl
Publication date: 8 October 2019
Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
This page was built for publication: Exact and heuristic algorithms for the weighted total domination problem