Heuristically determining cliques of given cardinality and with minimal cost within weighted complete graphs
- 1 June 1985
- journal article
- research article
- Published by Springer Nature in Mathematical Methods of Operations Research
- Vol. 29 (3) , 125-131
- https://doi.org/10.1007/bf01918201
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- Probabilistic asymptotic properties of some combinatorial optimization problemsDiscrete Applied Mathematics, 1985
- The facility selection-location problemOR Spectrum, 1984