Author:
Aloise Daniel,Hansen Pierre,Liberti Leo
Publisher
Springer Science and Business Media LLC
Subject
General Mathematics,Software
Reference68 articles.
1. Aloise D., Deshpande A., Hansen P., Popat P.: NP-hardness of Euclidean sum-of-squares clustering. Mach. Learn. 75, 245–249 (2009)
2. Aloise D., Hansen P.: A branch-and-cut SDP-based algorithm for minimum sum-of-squares clustering. Pesquisa Operacional 29, 503–516 (2009)
3. Aloise, D., Hansen, P.: Evaluating a branch-and-bound RLT-based algorithm for minimum sum-of-squares clustering. To appear in J. Glob. Optim. (2010)
4. An L.T., Belghiti M.T., Tao P.D.: A new efficient algorithm based on DC programming and DCA for clustering. J. Glob. Optim. 37, 593–608 (2007)
5. Asuncion, A., Newman, D.J.: UCI machine learning repository. http://www.ics.uci.edu/~mlearn/MLRepository.html . (2007)
Cited by
75 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献