Solving the minimum M-dominating set problem by a continuous optimization approach based on DC programming and DCA

被引:0
|
作者
Julien Schleich
Hoai An Le Thi
Pascal Bouvry
机构
[1] University of Luxembourg,SnT Interdisciplinary Center
[2] University Paul Verlaine—Metz,LITA
[3] University of Luxembourg,FSTC–CSC
来源
关键词
DC programming and DCA; Exact penalty; Minimum dominating set;
D O I
暂无
中图分类号
学科分类号
摘要
We propose a new optimization approach based on DC (Difference of Convex functions) programming and DCA (DC Algorithm) to the so-called Minimum M-Dominating Set problem in graphs. This problem is beforehand re-casted as a polyhedral DC program with the help of exact penalty in DC programming. The related DCA is original and computer efficient because it consists of solving a few linear programs and converges after a finite number of iterations to an integer solution while working in a continuous domain. Numerical simulations show the efficiency and robustness of DCA and its superiority with respect to standard methods.
引用
收藏
页码:397 / 412
页数:15
相关论文
共 50 条
  • [21] A MATHEURISTIC APPROACH FOR SOLVING THE 2-CONNECTED DOMINATING SET PROBLEM
    Jovanovic, Raka
    Voss, Stefan
    APPLICABLE ANALYSIS AND DISCRETE MATHEMATICS, 2020, 14 (03) : 775 - 799
  • [22] A dual-mode local search algorithm for solving the minimum dominating set problem
    Zhu, Enqiang
    Zhang, Yu
    Wang, Shengzhi
    Strash, Darren
    Liu, Chanjuan
    KNOWLEDGE-BASED SYSTEMS, 2024, 298
  • [23] Solving the Minimum Dominating Set Problem of Partitioned Graphs Using a Hybrid Bat Algorithm
    Abed, Saad Adnan
    Rais, Helmi Md
    EMERGING TRENDS IN INTELLIGENT COMPUTING AND INFORMATICS: DATA SCIENCE, INTELLIGENT INFORMATION SYSTEMS AND SMART COMPUTING, 2020, 1073 : 386 - 395
  • [24] An Optimization Algorithm for Minimum Connected Dominating Set Problem in Wireless Sensor Network
    Ahn, Namsu
    Park, Sungsoo
    INDUSTRIAL ENGINEERING AND MANAGEMENT SYSTEMS, 2011, 10 (03): : 221 - 231
  • [25] Algorithms for minimum m-connected k-dominating set problem
    Shang, Weiping
    Yao, Frances
    Wan, Pengjun
    Hu, Xiaodong
    COMBINATORIAL OPTIMIZATION AND APPLICATIONS, PROCEEDINGS, 2007, 4616 : 182 - +
  • [26] Solving the Capacitated Vertex K-Center Problem through the Minimum Capacitated Dominating Set Problem
    Cornejo Acosta, Jose Alejandro
    Garcia Diaz, Jesus
    Menchaca-Mendez, Ricardo
    Menchaca-Mendez, Rolando
    MATHEMATICS, 2020, 8 (09)
  • [27] DC Programming and DCA for Solving Minimum Sum-of-Squares Clustering Using Weighted Dissimilarity Measures
    Le Hoai Minh
    Ta Minh Thuy
    TRANSACTIONS ON COMPUTATIONAL COLLECTIVE INTELLIGENCE XIII, 2014, 8342 : 113 - 131
  • [28] Minimum connected dominating set solving algorithm based on immune particle swarm
    Wu M.
    Li J.
    Wen X.
    Liu F.
    Huazhong Keji Daxue Xuebao (Ziran Kexue Ban)/Journal of Huazhong University of Science and Technology (Natural Science Edition), 2019, 47 (11): : 90 - 95
  • [29] An algorithm for the minimum dominating set problem based on a new energy function
    Faculty of Engineering, Toyama University, Toyama-shi, 930-8555, Japan
    不详
    不详
    Society of Instrument and Control Engineers, (SICE); IEEE Industrial Electronics Society; IEEE Robotics and Automation Society; IEEE Control Systems Society; IEEE Systems, Man and Cybernetics Society, 1600, 1825-1827 (2004):
  • [30] An algorithm for the minimum dominating set problem based on a new energy function
    Xu, XS
    Tang, Z
    Sun, WD
    Chen, XM
    Li, Y
    Xia, GP
    Bi, WX
    Zong, ZL
    SICE 2004 ANNUAL CONFERENCE, VOLS 1-3, 2004, : 924 - 926