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
来源：
Journal of Combinatorial Optimization | 2012年 / 24卷
关键词：
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 条
  • [1] Solving the minimum M-dominating set problem by a continuous optimization approach based on DC programming and DCA
    Schleich, Julien
    Hoai An Le Thi
    Bouvry, Pascal
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2012, 24 (04) : 397 - 412
  • [2] Solving the Perceptron Problem by deterministic optimization approach based on DC programming and DCA
    An, Le Thi Hoai
    Minh, Le Hoai
    Tao, Pham Dinh
    Bouvry, Pascal
    2009 7TH IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL INFORMATICS, VOLS 1 AND 2, 2009, : 222 - +
  • [3] An optimization algorithm for the minimum k-connected m-dominating set problem in wireless sensor networks
    Namsu Ahn
    Sungsoo Park
    Wireless Networks, 2015, 21 : 783 - 792
  • [4] An optimization algorithm for the minimum k-connected m-dominating set problem in wireless sensor networks
    Ahn, Namsu
    Park, Sungsoo
    WIRELESS NETWORKS, 2015, 21 (03) : 783 - 792
  • [5] Solving the 2-connected m-dominating set problem using a GRASP approach for applications in power systems
    Jovanovic, Raka
    Bayram, Islam Safak
    Voss, Stefan
    PROCEEDINGS 2018 IEEE 12TH INTERNATIONAL CONFERENCE ON COMPATIBILITY, POWER ELECTRONICS AND POWER ENGINEERING (CPE-POWERENG 2018), 2018,
  • [6] On Approximating Minimum 3-Connected m-Dominating Set Problem in Unit Disk Graph
    Liu, Bei
    Wang, Wei
    Kim, Donghyun
    Li, Deying
    Wang, Jingyi
    Tokuta, Alade O.
    Jiang, Yaolin
    IEEE-ACM TRANSACTIONS ON NETWORKING, 2016, 24 (05) : 2722 - 2733
  • [7] A continuous approach for the concave cost supply problem via DC programming and DCA
    Le Thi, Hoai An
    Dinh, Tao Pham
    DISCRETE APPLIED MATHEMATICS, 2008, 156 (03) : 325 - 338
  • [8] Solving an Inventory Routing Problem in Supply Chain by DC Programming and DCA
    Quang Thuan Nguyen
    Hoai An Le Thi
    INTELLIGENT INFORMATION AND DATABASE SYSTEMS, ACIIDS 2011, PT II, 2011, 6592 : 432 - 441
  • [9] Solving nonmonotone affine variational inequalities problem by DC programming and DCA
    Kebaili, Zahira
    Achache, Mohamed
    ASIAN-EUROPEAN JOURNAL OF MATHEMATICS, 2020, 13 (03)
  • [10] An algorithm based on ant colony optimization for the minimum connected dominating set problem
    Bouamama, Salim
    Blum, Christian
    Fages, Jean-Guillaume
    APPLIED SOFT COMPUTING, 2019, 80 : 672 - 686
12345