Heuristically determining cliques of given cardinality and with minimal cost within weighted complete graphs
Year of publication: |
1985
|
---|---|
Authors: | Späth, H. |
Published in: |
Zeitschrift für Operations-Research : ZOR ; mathematical methods of operations research. - Heidelberg : Physica-Verl., ISSN 0340-9422, ZDB-ID 246737-9. - Vol. 29.1985, 3, p. 125-131
|
Subject: | Mathematik | Graphentheorie | Standort | Heuristik |
-
Facilities layout generalized model solved by n-boundary shortest path heuristics
Giffin, J. W., (1987)
-
Analysis of heuristics for finding a maximum weight planar subgraph
Dyer, M. E., (1985)
-
Heuristics with constant error guarantees for the design of tree networks
Altinkemer, Kemal, (1988)
- More ...
-
Späth, H., (1977)
-
Späth, H., (1977)
-
Zwei Fallstudien zum Einsatz partitionerender Cluster-Analyse-Algorithmen bei binären Merkmalen
Späth, H., (1976)
- More ...