Heuristically determining cliques of given cardinality and with minimal cost within weighted complete graphs (Q3705237)
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 3930755
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Heuristically determining cliques of given cardinality and with minimal cost within weighted complete graphs |
scientific article; zbMATH DE number 3930755 |
Statements
Heuristically determining cliques of given cardinality and with minimal cost within weighted complete graphs (English)
0 references
1985
0 references
clique of given cardinality
0 references
minimal cost
0 references
facilities selection
0 references
minimal distance
0 references
weighted complete graph
0 references
heuristic solution methods
0 references
0.8001986742019653
0 references
0.7879824042320251
0 references
0.7703685164451599
0 references
0.7605846524238586
0 references
0.7594642043113708
0 references
