Fast algorithm for the maximum weight clique problem

被引：0

作者：

Babel, L. ^{[1
]}

机构：

[1] Institut für Mathematik TU-München, Arcisstrasse 21, München, D-80290, Germany

来源：

Computing (Vienna/New York) | 1994年 / 52卷 / 01期

关键词：

Graph theory - Heuristic methods - Linear programming - Matrix algebra - Vectors;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

We present a branch and bound method which finds a maximum weight clique in an arbitrary weighted graph. The main ingredients are a weighted coloring heuristic which simultaneously produces lower and upper bounds and a branching rule that uses the information obtained in the coloring. The algorithm performs comparable to the fastest method known so far but is much easier to implement.

引用

页码：31 / 38

共 50 条

[1] A FAST ALGORITHM FOR THE MAXIMUM WEIGHT CLIQUE PROBLEM
BABEL, L
COMPUTING, 1994, 52 (01) : 31 - 38
[2] A fast algorithm for the maximum clique problem
Östergård, PRJ
DISCRETE APPLIED MATHEMATICS, 2002, 120 (1-3) : 197 - 207
[3] A Fast Genetic Algorithm for Solving the Maximum Clique Problem
Zhang, Suqi
Wang, Jing
Wu, Qing
Zhan, Jin
2014 10TH INTERNATIONAL CONFERENCE ON NATURAL COMPUTATION (ICNC), 2014, : 764 - 768
[4] ON THE MAXIMUM WEIGHT CLIQUE PROBLEM
BALAS, E
CHVATAL, V
NESETRIL, J
MATHEMATICS OF OPERATIONS RESEARCH, 1987, 12 (03) : 522 - 535
[5] An Exact Algorithm for the Maximum Weight Clique Problem in Large Graphs
Jiang, Hua
Li, Chu-Min
Manya, Felip
THIRTY-FIRST AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2017, : 830 - 838
[6] A Lagrangian Bound on the Clique Number and an Exact Algorithm for the Maximum Edge Weight Clique Problem
Hosseinian, Seyedmohammadhossein
Fontes, Dalila B. M. M.
Butenko, Sergiy
INFORMS JOURNAL ON COMPUTING, 2020, 32 (03) : 747 - 762
[7] 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
[8] Parallelization of a branch-and-bound algorithm for the maximum weight clique problem
Shimizu, Satoshi
Yamaguchi, Kazuaki
Masuda, Sumio
DISCRETE OPTIMIZATION, 2021, 41
[9] AN EXACT ALGORITHM FOR THE MAXIMUM CLIQUE PROBLEM
CARRAGHAN, R
PARDALOS, PM
OPERATIONS RESEARCH LETTERS, 1990, 9 (06) : 375 - 382
[10] A Genetic Algorithm for the Maximum Clique Problem
Moussa, Rebecca
Akiki, Romario
Harmanani, Haidar
16TH INTERNATIONAL CONFERENCE ON INFORMATION TECHNOLOGY-NEW GENERATIONS (ITNG 2019), 2019, 800 : 569 - 574

← 1 2 3 4 5 →