Integer linear programming models for the weighted total domination problem

被引：16
|
作者：
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 条
  • [41] USING INTEGER LINEAR PROGRAMMING FOR DISCRETE PROBLEM OPTIMIZATION
    Sklenar, Jaroslav
    Cutajar, Valerie
    Ceska, Milan
    EUROPEAN SIMULATION AND MODELLING CONFERENCE 2008, 2008, : 19 - +
  • [42] An integer linear programming model for the label printing problem
    Xu, Dehua
    Shen, Yuan
    Cao, Yu
    Xu, Limin
    Yang, Fengzhao
    Xie, Yunzhou
    INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2025, 32 (01) : 270 - 288
  • [43] IMPROVED MIXED INTEGER LINEAR PROGRAMING FORMULATIONS FOR ROMAN DOMINATION PROBLEM
    Ivanovic, Marija
    PUBLICATIONS DE L INSTITUT MATHEMATIQUE-BEOGRAD, 2016, 99 (113): : 51 - 58
  • [44] Sequential linear integer programming for integer optimal control with total variation regularization*
    Leyffer, Sven
    Manns, Paul
    ESAIM-CONTROL OPTIMISATION AND CALCULUS OF VARIATIONS, 2022, 28
  • [45] 3 MODELS OF FUZZY INTEGER LINEAR-PROGRAMMING
    HERRERA, F
    VERDEGAY, JL
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1995, 83 (03) : 581 - 593
  • [46] Integer programming models for the pre-marshalling problem
    Parreno-Torres, Consuelo
    Alvarez-Valdes, Ramon
    Ruiz, Ruben
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2019, 274 (01) : 142 - 154
  • [47] Integer programming models for the routing and spectrum allocation problem
    Federico Bertero
    Marcelo Bianchetti
    Javier Marenco
    TOP, 2018, 26 : 465 - 488
  • [48] Integer programming models for the q-mode problem
    Kulkarni, Girish
    Fathi, Yahya
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 182 (02) : 612 - 625
  • [49] A comparison of integer and constraint programming models for the deficiency problem
    Altinakar, Sivan
    Caporossi, Gilles
    Hertz, Alain
    COMPUTERS & OPERATIONS RESEARCH, 2016, 68 : 89 - 96
  • [50] Integer programming models for the routing and spectrum allocation problem
    Bertero, Federico
    Bianchetti, Marcelo
    Marenco, Javier
    TOP, 2018, 26 (03) : 465 - 488
12345