On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem
type: Item
instance of: scholarly article
title: On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem
zbMATH Open document ID: 1391.90607
author: Chu-Min Li
author: Hua Jiang
author: Felip Manya
published in: Computers \& Operations Research
publication date: 2018-07-11T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 6901426
zbMATH Keywords: maximum clique problem
zbMATH Keywords: branch-and-bound
zbMATH Keywords: branching ordering
zbMATH Keywords: incremental maxsat reasoning
describes a project that uses: MaxCliqueDyn
describes a project that uses: BBMCL
MaRDI profile type: Publication
full work available at URL: j.cor.2017.02.017
OpenAlex ID: W2589796617
cites work: A branch and bound algorithm for the maximum clique problem
cites work: Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem
cites work: Optimal Protein Structure Alignment Using Maximum Cliques
cites work: Breakout local search for maximum clique problems
cites work: Mining market data: a network approach
cites work: Local search with edge weighting and configuration checking heuristics for minimum vertex cover
cites work: An exact algorithm for the maximum clique problem
cites work: Greedy and heuristic algorithms for codes and colorings
cites work: Q4411385
cites work: Simple ingredients leading to very efficient heuristics for the maximum clique problem
cites work: An improved branch and bound algorithm for the maximum clique problem
cites work: Keller’s cube-tiling conjecture is false in high dimensions
cites work: Multi-threading a state-of-the-art maximum clique algorithm
cites work: A fast algorithm for the maximum clique problem
cites work: Exact algorithms for maximum clique: a computational study
cites work: Q3623999
cites work: A tutorial on branch and cut algorithms for the maximum stable set problem
cites work: Principles and Practice of Constraint Programming – CP 2003
cites work: An exact bit-parallel algorithm for the maximum clique problem
cites work: Relaxed approximate coloring in exact maximum clique search
cites work: An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments
cites work: Q4452109
cites work: A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique
cites work: A review on algorithms for maximum clique problems
cites work: Random constraint satisfaction: easy generation of hard (satisfiable) instances
DOI: 10.1016/J.COR.2017.02.017
Recommended article: A branch and bound algorithm for the maximum clique problem
Recommended article: An improved branch and bound algorithm for the maximum clique problem
Recommended article: An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments
Recommended article: Q4452109
Recommended article: A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique
Recommended article: A branch-and-bound approach for maximum quasi-cliques
Recommended article: Q4527181
Recommended article: Speeding up branch and bound algorithms for solving the maximum clique problem
description: scientific article; zbMATH DE number 6901426