Integer linear programming models for the weighted total domination problem

DOI10.1016/J.AMC.2019.04.038MaRDI QIDQ2279352zbMATH OpenOpenAlexWikidataFDO

Authors Yue-de Ma, Qingqiong Cai, Shunyu Yao

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)

Recommendations

• Exact and heuristic algorithms for the weighted total domination problem
• On total \(f\)-domination: polyhedral and algorithmic results
• Total Domination and Irredundance in Weighted Interval Graphs
• The weighted perfect domination problem and its variants
• Weak total domination in graphs

Cites work

• A survey of selected recent results on total domination in graphs
• A textbook of graph theory
• Coupon coloring of some special graphs
• Domination in convex and chordal bipartite graphs
• Independent domination in graphs: A survey and recent results
• On the \([1,2]\)-domination number of generalized Petersen graphs
• On the double Roman domination of graphs
• The minimum connected dominating set problem: formulation, valid inequalities and a branch-and-cut algorithm
• The weighted independent domination problem: integer linear programming models and metaheuristic approaches
• Total Domination and Irredundance in Weighted Interval Graphs

Cited in

(9)

• On upper bounds for total k-domination number via the probabilistic method
• Linear programming formulation for some generalized domination parameters
• An integer programming approach for solving a generalized version of the Grundy domination number
• Exact and heuristic algorithms for the weighted total domination problem
• Note on the perfect Roman domination number of graphs
• A knowledge-based iterated local search for the weighted total domination problem
• The weighted perfect domination problem and its variants
• A comparison of integer programming models for the partial directed weighted improper coloring problem
• Algorithm and hardness results on neighborhood total domination in graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2279352)