On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Computers and Operations Research Année : 2017

On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem

(1, 2) , (3) , (4)
1
2
3
4

Résumé

When searching for a maximum clique in a graph G, branch-and-bound algorithms in the literature usually focus on the minimization of the number of branches generated at each search tree node. We call dynamic strategy this minimization without any constraint, because it induces a dynamic vertex ordering in G during the search. In this paper, we introduce a static strategy that minimizes the number of branches subject to the constraint that a static vertex ordering in G must be kept during the search. We analyze the two strategies and show that they are complementary. From this complementarity, we propose a new algorithm, called MoMC, that combines the strengths of the two strategies into a single algorithm. The reported experimental results show that MoMC is generally better than the algorithms implementing a single strategy. (C) 2017 Elsevier Ltd. All rights reserved.
Fichier non déposé

Dates et versions

hal-03636427 , version 1 (10-04-2022)

Identifiants

Citer

Chu-Min Li, Hua Jiang, Felip Manya. On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem. Computers and Operations Research, 2017, 84, pp.1-15. ⟨10.1016/j.cor.2017.02.017⟩. ⟨hal-03636427⟩
27 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook Twitter LinkedIn More