A new family of facet defining inequalities for the maximum edge-weighted clique problem

被引：2
|
作者：
Fomeni, Franklin Djeumou [1 ,2 ]
机构：
[1] Polytech Montreal, Gerad, Montreal, PQ H3T 3A7, Canada
[2] Polytech Montreal, Dept Math & Ind Engn, Montreal, PQ H3T 3A7, Canada
来源：
OPTIMIZATION LETTERS | 2017年 / 11卷 / 01期
关键词：
Edge-weighted clique problem; Cutting planes; Separation algorithm; Integer programming; Boolean quadric polytope; Facet defining inequalities; QUADRATIC KNAPSACK-PROBLEM; ALGORITHMS; POLYTOPE;
D O I：
10.1007/s11590-016-1055-z
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
This paper considers a family of cutting planes, recently developed for mixed 0-1 polynomial programs and shows that they define facets for the maximum edge-weighted clique problem. There exists a polynomial time exact separation algorithm for these inequalities. The result of this paper may contribute to the development of more efficient algorithms for the maximum edge-weighted clique problem that use cutting planes.
引用
收藏
页码：47 / 54
页数：8
相关论文
共 50 条
  • [41] A new upper bound for the maximum weight clique problem
    Li, Chu-Min
    Liu, Yanli
    Jiang, Hua
    Manya, Felip
    Li, Yu
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2018, 270 (01) : 66 - 77
  • [42] Annealed replication: a new heuristic for the maximum clique problem
    Bomze, IM
    Budinich, M
    Pelillo, M
    Rossi, C
    DISCRETE APPLIED MATHEMATICS, 2002, 121 (1-3) : 27 - 49
  • [43] Solving the Maximum Weighted Clique Problem Based on Parallel Biological Computing Model
    Wang, Zhaocai
    Qin, Jiangfeng
    Ji, Zuwen
    Huang, Dongmei
    Li, Lei
    MATHEMATICAL PROBLEMS IN ENGINEERING, 2015, 2015
  • [44] Solving the maximum edge weight clique problem via unconstrained quadratic programming
    Alidaee, Bahram
    Glover, Fred
    Kochenberger, Gary
    Wang, Haibo
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 181 (02) : 592 - 597
  • [45] Variable Neighborhood Search for Partitioning Sparse Biological Networks into the Maximum Edge-Weighted k-Plexes
    Grbic, Milana
    Kartelj, Aleksandar
    Jankovic, Savka
    Matic, Dragan
    Filipovic, Vladimir
    IEEE-ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS, 2020, 17 (05) : 1822 - 1831
  • [46] A new trust region technique for the maximum weight clique problem
    Busygin, Stanislav
    DISCRETE APPLIED MATHEMATICS, 2006, 154 (15) : 2080 - 2096
  • [47] A local search algorithm with hybrid strategies for the maximum weighted quasi-clique problem
    Zhou, Jincheng
    Liu, Shuhong
    Gao, Jian
    ELECTRONICS LETTERS, 2023, 59 (01)
  • [48] Clustering analysis of microRNA and mRNA expression data from TCGA using maximum edge-weighted matching algorithms
    Lizhong Ding
    Zheyun Feng
    Yongsheng Bai
    BMC Medical Genomics, 12
  • [49] Solving the maximum edge-weight clique problem in sparse graphs with compact formulations
    Gouveia, Luis
    Martins, Pedro
    EURO JOURNAL ON COMPUTATIONAL OPTIMIZATION, 2015, 3 (01) : 1 - 30
  • [50] New facets and a branch-and-cut algorithm for the weighted clique problem
    Sorensen, MA
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2004, 154 (01) : 57 - 70
12345