A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems

Bagirov, Adil M. and Yearwood, John 2006, A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems, European journal of operational research, vol. 170, no. 2, pp. 578-596, doi: 10.1016/j.ejor.2004.06.014.

Attached Files
Name Description MIMEType Size Downloads

Title A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems
Author(s) Bagirov, Adil M.
Yearwood, JohnORCID iD for Yearwood, John orcid.org/0000-0002-7562-6767
Journal name European journal of operational research
Volume number 170
Issue number 2
Start page 578
End page 596
Total pages 19
Publisher Elsevier
Place of publication Amsterdam, The Netherlands
Publication date 2006-04-16
ISSN 0377-2217
1872-6860
Keyword(s) nonsmooth optimization
cluster analysis
minimum sum-of-squares clustering
Language eng
DOI 10.1016/j.ejor.2004.06.014
Field of Research MD Multidisciplinary
HERDC Research category C1.1 Refereed article in a scholarly journal
Copyright notice ©2004, Elsevier
Persistent URL http://hdl.handle.net/10536/DRO/DU:30101508

Document type: Journal Article
Collection: Centre for Pattern Recognition and Data Analytics
Connect to link resolver
 
Unless expressly stated otherwise, the copyright for items in DRO is owned by the author, with all rights reserved.

Versions
Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 0 times in TR Web of Science
Scopus Citation Count Cited 57 times in Scopus
Google Scholar Search Google Scholar
Access Statistics: 62 Abstract Views, 0 File Downloads  -  Detailed Statistics
Created: Thu, 03 Aug 2017, 12:25:34 EST

Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact drosupport@deakin.edu.au.