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 条
  • [1] A new family of facet defining inequalities for the maximum edge-weighted clique problem
    Franklin Djeumou Fomeni
    Optimization Letters, 2017, 11 : 47 - 54
  • [2] A new branch-and-bound algorithm for the maximum edge-weighted clique problem
    San Segundo, Pablo
    Coniglio, Stefano
    Furini, Fabio
    Ljubic, Ivana
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2019, 278 (01) : 76 - 90
  • [3] The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations
    Macambira, EM
    de Souza, CC
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2000, 123 (02) : 346 - 371
  • [4] A Fast Exact Solver with Theoretical Analysis for the Maximum Edge-Weighted Clique Problem
    Liu, Lu
    Xiao, Mingyu
    Zhou, Yi
    THIRTY-EIGHTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOL 38 NO 18, 2024, : 20768 - 20776
  • [5] A Lagrangian relaxation approach to the edge-weighted clique problem
    Hunting, M
    Faigle, U
    Kern, W
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2001, 131 (01) : 119 - 131
  • [6] An extended formulation approach to the edge-weighted maximal clique problem
    Department of Industrial Engineering, Korea Adv. Inst. Sci. and Technol., 373-1 Gusong-dong, Yusong-gu, Taejon 305-701, Korea, Republic of
    Eur J Oper Res, 3 (671-682):
  • [7] An extended formulation approach to the edge-weighted maximal clique problem
    Park, K
    Lee, K
    Park, S
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1996, 95 (03) : 671 - 682
  • [8] A CUTTING-PLANE APPROACH TO THE EDGE-WEIGHTED MAXIMAL CLIQUE PROBLEM
    DIJKHUIZEN, G
    FAIGLE, U
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1993, 69 (01) : 121 - 130
  • [9] Solving Edge-Weighted Maximum Clique Problem with DCA Warm-Start Quantum Approximate Optimization Algorithm
    Huy Phuc Nguyen Ha
    Viet Hung Nguyen
    Anh Son Ta
    METAHEURISTICS, MIC 2024, PT I, 2024, 14753 : 246 - 261
  • [10] An Efficient Local Search for the Maximum Edge Weighted Clique Problem
    Li, Ruizhi
    Wu, Xiaoli
    Liu, Huan
    Wu, Jun
    Yin, Minghao
    IEEE ACCESS, 2018, 6 : 10743 - 10753
12345