A new branch-and-bound algorithm for the maximum weighted clique problem (Q2002840)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7080336
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new branch-and-bound algorithm for the maximum weighted clique problem |
scientific article; zbMATH DE number 7080336 |
Statements
A new branch-and-bound algorithm for the maximum weighted clique problem (English)
0 references
12 July 2019
0 references
maximum weighted clique problem
0 references
branch-and-bound algorithm
0 references
computational results
0 references
0 references
0.9027734994888306
0 references
0.8956058621406555
0 references
0.8591386079788208
0 references
0.856305718421936
0 references
0.8470131754875183
0 references
