Integer linear programming models for the weighted total domination problem

DOI10.1016/j.amc.2019.04.038zbMath1428.90102OpenAlexW2941169594WikidataQ128023765 ScholiaQ128023765MaRDI QIDQ2279352

Shunyu Yao, Yuede Ma, Qingqiong Cai

Publication date: 12 December 2019

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2019.04.038

zbMATH Keywords

combinatorial optimizationgraph theoryinteger linear programmingweighted total domination

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (5)

On upper bounds for total k-domination number via the probabilistic method ⋮ Algorithm and hardness results on neighborhood total domination in graphs ⋮ Exact and heuristic algorithms for the weighted total domination problem ⋮ Note on the perfect Roman domination number of graphs ⋮ Linear programming formulation for some generalized domination parameters

Cites Work

• Coupon coloring of some special graphs
• Domination in convex and chordal bipartite graphs
• A survey of selected recent results on total domination in graphs
• The weighted independent domination problem: integer linear programming models and metaheuristic approaches
• Independent domination in graphs: A survey and recent results
• On the double Roman domination of graphs
• On the \([1,2\)-domination number of generalized Petersen graphs]
• The Minimum Connected Dominating Set Problem: Formulation, Valid Inequalities and a Branch-and-Cut Algorithm
• Total Domination and Irredundance in Weighted Interval Graphs
• A textbook of graph theory

This page was built for publication: Integer linear programming models for the weighted total domination problem