A multi-KP modeling for the maximum-clique problem (Q1328650)
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: A multi-KP modeling for the maximum-clique problem |
scientific article; zbMATH DE number 611368
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A multi-KP modeling for the maximum-clique problem |
scientific article; zbMATH DE number 611368 |
Statements
A multi-KP modeling for the maximum-clique problem (English)
0 references
26 July 1994
0 references
heuristics
0 references
maximum clique
0 references
0-1 multidimensional knapsack
0 references
greedy algorithm
0 references
branch-and-bound
0 references
0 references
0 references
0.806621253490448
0 references
0.8063929080963135
0 references
0.8038634657859802
0 references
0.8032072186470032
0 references
0.7995747327804565
0 references
