Heuristically determining cliques of given cardinality and with minimal cost within weighted complete graphs (Q3705237): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Probabilistic asymptotic properties of some combinatorial optimization problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The facility selection-location problem / rank | |||
Normal rank | |||
Latest revision as of 10:03, 17 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Heuristically determining cliques of given cardinality and with minimal cost within weighted complete graphs |
scientific article |
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
