A new upper bound for the maximum weight clique problem
type: Item
instance of: scholarly article
title: A new upper bound for the maximum weight clique problem
zbMATH Open document ID: 1403.90640
author: Chu-Min Li
author: Yanli Liu
author: Hua Jiang
author: Felip Manya
author: Y. Li
published in: European Journal of Operational Research
publication date: 2018-05-31T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 6877269
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: branch and bound
zbMATH Keywords: maximum weight clique problem
zbMATH Keywords: upper bound
zbMATH Keywords: weight cover
describes a project that uses: MaxCliqueDyn
describes a project that uses: BBMCSP
describes a project that uses: BBMCL
MaRDI profile type: Publication
full work available at URL: j.ejor.2018.03.020
OpenAlex ID: W2790214862
cites work: Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs
cites work: Clique-detection models in computational biochemistry and genomics
cites work: An exact algorithm based on MaxSAT reasoning for the maximum weight clique problem
cites work: Q4198056
cites work: Maximum-weight stable sets and safe lower bounds for graph coloring
cites work: An improved branch and bound algorithm for the maximum clique problem
cites work: On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem
cites work: Optimizing with minimum satisfiability
cites work: A new exact maximum clique algorithm for large and massive sparse graphs
cites work: An improved bit parallel exact maximum clique algorithm
cites work: Infra-chromatic bound for exact maximum clique search
cites work: Relaxed approximate coloring in exact maximum clique search
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: PUSH: A generalized operator for the maximum vertex weight clique problem
Wikidata QID: Q130107384
DOI: 10.1016/J.EJOR.2018.03.020
description: scientific article; zbMATH DE number 6877269