Variable neighbourhood search based heuristic for K-harmonic means clustering
Although there has been a rapid development of technology and increase of computation speeds, most of the real-world optimization problems still cannot be solved in a reasonable time. Some times it is impossible for them to be optimally solved, as there are many instances of real problems which cann...
Main Author: | Al-Guwaizani, Abdulrahman |
---|---|
Other Authors: | Mladenović, N. |
Published: |
Brunel University
2011
|
Subjects: | |
Online Access: | http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.539926 |
Similar Items
-
New variable neighbourhood search based 0-1 MIP heuristics
by: Hanafi Saïd, et al.
Published: (2015-01-01) -
Candidate group search(CGS) for K-harmonic means data clustering
by: Hua-Min Chiou, et al.
Published: (2014) -
Schelling's Bounded Neighbourhood Model : a systematic investigation
by: Afshar Dodson, Ali James Elliot
Published: (2014) -
A new heuristic-based model of goal recognition without libraries
by: Pattison, David Thomas
Published: (2015) -
Enhanced heuristics for numeric temporal planning
by: Piacentini, Chiara
Published: (2015)