𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Randomised Local Search Algorithm for the Clustering Problem

✍ Scribed by P. Fränti; J. Kivijärvi

Publisher
Springer-Verlag
Year
2000
Tongue
English
Weight
367 KB
Volume
3
Category
Article
ISSN
1433-7541

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A tabu search-based algorithm for the fu
A tabu search-based algorithm for the fuzzy clustering problem
✍ Khaled S Al-Sultan; Chawki A Fedjki 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 597 KB

The Fuzzy Clustering Problem (FCP) is a mathematical program which is difficult to solve since it is nonconvex, which implies possession of many local minima. The fuzzy C-means heuristic is the widely known approach to this problem, but it is guaranteed only to yield local minima. In this paper, we

Local search algorithms for the k-cardin
Local search algorithms for the k-cardinality tree problem
✍ Christian Blum; Matthias Ehrgott 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 463 KB

In this paper we deal with an NP-hard combinatorial optimization problem, the k-cardinality tree problem in node-weighted graphs. This problem has several applications, which justify the need for e cient methods to obtain good solutions. We review existing literature on the problem. Then we prove th