PUSH: A generalized operator for the Maximum Vertex Weight Clique Problem

被引:21
|
作者
Zhou, Yi [1 ]
Hao, Jin-Kao [1 ,2 ]
Goeffon, Adrien [1 ]
机构
[1] Univ Angers, LERIA, 2 Blvd Lavoisier, F-49045 Angers, France
[2] Inst Univ France, Paris, France
关键词
Local search; Cliques; Tabu search; Heuristics; OPTIMAL WINNER DETERMINATION; COMBINATORIAL AUCTIONS; EXACT ALGORITHM; LOCAL SEARCH;
D O I
10.1016/j.ejor.2016.07.056
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
The Maximum Vertex Weight Clique Problem (MVWCP) is an important generalization of the well-known NP-hard Maximum Clique Problem. In this paper, we introduce a generalized move operator called PUSH, which generalizes the conventional ADD and SWAP operators commonly used in the literature and can be integrated in a local search algorithm for MVWCP. The PUSH operator also offers opportunities to define new search operators by considering dedicated candidate push sets. To demonstrate the usefulness of the proposed operator, we implement two simple tabu search algorithms which use PUSH to explore different candidate push sets. The computational results on 142 benchmark instances from different sources (DIMACS, BHOSLIB, and Winner Determination Problem) indicate that these algorithms compete favorably with the leading MVWCP algorithms. (C) 2016 Elsevier B.V. All rights reserved.
引用
收藏
页码:41 / 54
页数:14
相关论文
共 50 条
  • [21] ON GRAPHS WITH POLYNOMIALLY SOLVABLE MAXIMUM-WEIGHT CLIQUE PROBLEM
    BALAS, E
    YU, CS
    NETWORKS, 1989, 19 (02) : 247 - 253
  • [22] Molecular beacon computing model for maximum weight clique problem
    Yin, Zhixiang
    Cui, Jianzhong
    Zhen, Chen
    MATHEMATICS AND COMPUTERS IN SIMULATION, 2018, 151 : 147 - 155
  • [23] Minimum Vertex Blocker Clique Problem
    Pajouh, Foad Mahdavi
    Boginski, Vladimir
    Pasiliao, Eduardo L.
    NETWORKS, 2014, 64 (01) : 48 - 64
  • [24] Maximum Decoding Clique Based Maximum Weight Vertex Search Algorithm for Buffered Instantly Decodable Network Codes
    Mei, Zhonghui
    Zhou, Xiaoyan
    IEEE COMMUNICATIONS LETTERS, 2022, 26 (02) : 229 - 233
  • [25] An Exact Algorithm Based on MaxSAT Reasoning for the Maximum Weight Clique Problem
    Fang, Zhiwen
    Li, Chu-Min
    Xu, Ke
    JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2016, 55 : 799 - 833
  • [26] A nonconvex quadratic optimization approach to the maximum edge weight clique problem
    Seyedmohammadhossein Hosseinian
    Dalila B. M. M. Fontes
    Sergiy Butenko
    Journal of Global Optimization, 2018, 72 : 219 - 240
  • [27] Parallelization of a branch-and-bound algorithm for the maximum weight clique problem
    Shimizu, Satoshi
    Yamaguchi, Kazuaki
    Masuda, Sumio
    DISCRETE OPTIMIZATION, 2021, 41
  • [28] A nonconvex quadratic optimization approach to the maximum edge weight clique problem
    Hosseinian, Seyedmohammadhossein
    Fontes, Dalila B. M. M.
    Butenko, Sergiy
    JOURNAL OF GLOBAL OPTIMIZATION, 2018, 72 (02) : 219 - 240
  • [29] RCPred: RNA complex prediction as a constrained maximum weight clique problem
    Audrey Legendre
    Eric Angel
    Fariza Tahi
    BMC Bioinformatics, 20
  • [30] A Parallel Ant Colony Optimization for the Maximum-Weight Clique Problem
    El Baz, Didier
    Hifi, Mhand
    Wu, Lei
    Shi, Xiaochuan
    2016 IEEE 30TH INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM WORKSHOPS (IPDPSW), 2016, : 796 - 800