Solving the Set Packing Problem via a Maximum Weighted Independent Set Heuristic

被引：4
|
作者：
Li, Ruizhi [1 ,2 ]
Wang, Yupan [3 ]
Hu, Shuli [3 ]
Jiang, Jianhua [1 ]
Ouyang, Dantong [2 ]
Yin, Minghao [3 ,4 ]
机构：
[1] Jilin Univ Finance & Econ, Sch Management Sci & Informat Engn, Changchun 130117, Peoples R China
[2] Jilin Univ, Sch Comp Sci & Technol, Changchun 130012, Peoples R China
[3] Northeast Normal Univ, Sch Comp Sci & Informat Technol, Changchun 130024, Peoples R China
[4] Northeast Normal Univ, MOE, Key Lab Appl Stat, Changchun 130117, Peoples R China
来源：
MATHEMATICAL PROBLEMS IN ENGINEERING | 2020年 / 2020卷
基金：
中国国家自然科学基金; 中国博士后科学基金;
关键词：
EFFICIENT LOCAL SEARCH; CONFIGURATION CHECKING; GENETIC ALGORITHM; GRASP;
D O I：
10.1155/2020/3050714
中图分类号：
T [工业技术];
学科分类号：
08 ;
摘要：
The set packing problem (SPP) is a significant NP-hard combinatorial optimization problem with extensive applications. In this paper, we encode the set packing problem as the maximum weighted independent set (MWIS) problem and solve the encoded problem with an efficient algorithm designed to the MWIS problem. We compare the independent set-based method with the state-of-the-art algorithms for the set packing problem on the 64 standard benchmark instances. The experimental results show that the independent set-based method is superior to the existing algorithms in terms of the quality of the solutions and running time obtained the solutions.
引用
收藏
页数：11
相关论文
共 50 条
  • [21] SOLVING THE SINGLE STEP GRAPH SEARCHING PROBLEM BY SOLVING THE MAXIMUM 2-INDEPENDENT SET PROBLEM
    HSIAO, JY
    TANG, CY
    CHANG, RS
    INFORMATION PROCESSING LETTERS, 1991, 40 (05) : 283 - 287
  • [22] Solving Set Cover and Dominating Set via Maximum Satisfiability
    Lei, Zhendong
    Cai, Shaowei
    THIRTY-FOURTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, THE THIRTY-SECOND INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE AND THE TENTH AAAI SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2020, 34 : 1569 - 1576
  • [23] AN O(20.304N) ALGORITHM FOR SOLVING MAXIMUM INDEPENDENT SET PROBLEM
    JIAN, T
    IEEE TRANSACTIONS ON COMPUTERS, 1986, 35 (09) : 847 - 851
  • [24] A Note on the P-time Algorithms for Solving the Maximum Independent Set Problem
    Esfahani, Navid Nasr
    Mazrooei, Parisa
    Mahdaviani, Kaveh
    Omoomi, Behnaz
    2009 2ND CONFERENCE ON DATA MINING AND OPTIMIZATION, 2009, : 72 - +
  • [25] SOLVING THE MINIMUM INDEPENDENT DOMINATION SET PROBLEM IN GRAPHS BY EXACT ALGORITHM AND GREEDY HEURISTIC
    Laforest, Christian
    Phan, Raksmey
    RAIRO-OPERATIONS RESEARCH, 2013, 47 (03) : 199 - 221
  • [26] EFFICIENT HEURISTIC ALGORITHMS FOR THE WEIGHTED SET COVERING PROBLEM
    BAKER, EK
    COMPUTERS & OPERATIONS RESEARCH, 1981, 8 (04) : 303 - 310
  • [27] An Improved Approximation for Maximum Weighted k-Set Packing
    Thiery, Theophile
    Ward, Justin
    PROCEEDINGS OF THE 2023 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2023, : 1138 - 1162
  • [28] Approximation algorithms for the weighted independent set problem
    Kako, A
    Ono, T
    Hirata, T
    Halldórsson, MM
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2005, 3787 : 341 - 350
  • [29] The maximum independent set problem in planar graphs
    Alekseev, Vladimir E.
    Lozin, Vadim
    Malyshev, Dmitriy
    Milanic, Martin
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2008, PROCEEDINGS, 2008, 5162 : 96 - +
  • [30] An efficient local search algorithm with large neighborhoods for the maximum weighted independent set problem†
    Haraguchi, Kazuya
    Hashimoto, Hideki
    Itoyanagi, Junji
    Yagiura, Mutsunori
    INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2019, 26 (04) : 1244 - 1268
12345