Integer linear programming models for the weighted total domination problem

被引：14
|
作者：
Ma, Yuede [1 ]
Cai, Qingqiong [2 ]
Yao, Shunyu [3 ,4 ]
机构：
[1] Xian Technol Univ, Sch Sci, Xian 710021, Shanxi, Peoples R China
[2] Nankai Univ, Coll Comp Sci, Tianjin 300350, Peoples R China
[3] Nankai Univ, Ctr Combinator, Tianjin 300071, Peoples R China
[4] Nankai Univ, LPMC, Tianjin 300071, Peoples R China
来源：
APPLIED MATHEMATICS AND COMPUTATION | 2019年 / 358卷
基金：
中国国家自然科学基金;
关键词：
Weighted total domination; Integer linear programming; Combinatorial optimization; Graph theory; INDEPENDENT DOMINATION;
D O I：
10.1016/j.amc.2019.04.038
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
A total dominating set of a graph G = (V, E) is a subset D of V such that every vertex in V (including the vertices from D) has at least one neighbour in D. Suppose that every vertex v is an element of V has an integer weight w(v) >= 0 and every edge e is an element of E has an integer weight w(e) >= 0. Then the weighted total domination (WTD) problem is to find a total dominating set D which minimizes the cost f (D) := Sigma(u is an element of D )w(u) + Sigma(e is an element of E[D]) w(e) + Sigma(v is an element of V\D) min{w(uv) vertical bar u is an element of N(v) boolean AND D}. In this paper, we put forward three integer linear programming (ILP) models with a polynomial number of constraints, and present some numerical results implemented on random graphs for WTD problem. (C) 2019 Elsevier Inc. All rights reserved.
引用
收藏
页码：146 / 150
页数：5
相关论文
共 50 条
  • [1] The weighted independent domination problem: Integer linear programming models and metaheuristic approaches
    Pinacho Davidson, Pedro
    Blum, Christian
    Lozano, Jose A.
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2018, 265 (03) : 860 - 871
  • [2] Integer linear programming formulations for double roman domination problem
    Cai, Qingqiong
    Fan, Neng
    Shi, Yongtang
    Yao, Shunyu
    [J]. OPTIMIZATION METHODS & SOFTWARE, 2022, 37 (01): : 1 - 22
  • [3] Solving a Malleable Jobs Scheduling Problem to Minimize Total Weighted Completion Times by Mixed Integer Linear Programming Models
    Nhan-Quy Nguyen
    Yalaoui, Farouk
    Amodeo, Lionel
    Chehade, Hicham
    Toggenburger, Pascal
    [J]. Intelligent Information and Database Systems, ACIIDS 2016, Pt II, 2016, 9622 : 286 - 295
  • [4] Compact mixed integer linear programming models to the minimum weighted tree reconstruction problem
    Fortz, Bernard
    Oliveira, Olga
    Requejo, Cristina
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2017, 256 (01) : 242 - 251
  • [5] Improved integer linear programming formulation for weak Roman domination problem
    Ivanovic, Marija
    [J]. SOFT COMPUTING, 2018, 22 (19) : 6583 - 6593
  • [6] Improved integer linear programming formulation for weak Roman domination problem
    Marija Ivanović
    [J]. Soft Computing, 2018, 22 : 6583 - 6593
  • [7] Integer linear programming models for a cement delivery problem
    Hertz, Alain
    Uldry, Marc
    Widmer, Marino
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2012, 222 (03) : 623 - 631
  • [8] Integer linear programming models for the skiving stock problem
    Martinovic, J.
    Scheithauer, G.
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2016, 251 (02) : 356 - 368
  • [9] Integer Linear Programming Models for the Containership Stowage Problem
    Zhu, Huiling
    Ji, Mingjun
    Guo, Wenwen
    [J]. MATHEMATICAL PROBLEMS IN ENGINEERING, 2020, 2020
  • [10] New Integer Linear Programming Models for the Vertex Coloring Problem
    Jabrayilov, Adalat
    Mutzel, Petra
    [J]. LATIN 2018: THEORETICAL INFORMATICS, 2018, 10807 : 640 - 652
12345