𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An adaptive tabu search algorithm for the capacitated clustering problem

✍ Scribed by Paulo M. França; Nelida M. Sosa; Vitoria Pureza

Book ID
108481141
Publisher
John Wiley and Sons
Year
1999
Tongue
English
Weight
165 KB
Volume
6
Category
Article
ISSN
0969-6016

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A tabu search algorithm for the Capacita
A tabu search algorithm for the Capacitated Shortest Spanning Tree Problem
✍ Sharaiha, Yazid M.; Gendreau, Michel; Laporte, Gilbert; Osman, Ibrahim H. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 150 KB 👁 2 views

The Capacitated Shortest Spanning Tree Problem consists of determining a shortest spanning tree in a vertex weighted graph such that the weight of every subtree linked to the root by an edge does not exceed a prescribed capacity. We propose a tabu search heuristic for this problem, as well as dynami

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