Solving the maximum vertex weight clique problem via binary quadratic programming (Q306100)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Solving the maximum vertex weight clique problem via binary quadratic programming |
scientific article; zbMATH DE number 6620841
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving the maximum vertex weight clique problem via binary quadratic programming |
scientific article; zbMATH DE number 6620841 |
Statements
Solving the maximum vertex weight clique problem via binary quadratic programming (English)
0 references
31 August 2016
0 references
maximum vertex weight clique
0 references
binary quadratic programming
0 references
probabilistic tabu search
0 references
0 references
0 references
0 references
0 references
0.8000461459159851
0 references
0.7828644514083862
0 references
0.776140570640564
0 references
0.7722080945968628
0 references
0.7596908807754517
0 references
