Heuristically determining cliques of given cardinality and with minimal cost within weighted complete graphs (Q3705237): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/bf01918201 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2003196729 / rank | |||
Normal rank |
Latest revision as of 10:45, 30 July 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