Downloads: 128
Research Paper | Mathematics | Volume 5 Issue 12, December 2016 | Pages: 593 - 597 | Korea, North
Study on a Smoothing and Relaxation Method of Optimization Problem for Clustering of Bibliometric Networks
Abstract: Optimization problems for clustering of bibliometric networks are discrete optimization ones with discontinuous objective functions. Therefore, we can not apply the traditional optimization methods to solve in these problems. In this paper, we studied smoothing and relaxation method of optimization problems for clustering bibliometric networks.
Keywords: discrete discontinuous optimization problem, clustering, smoothing method, relaxation method
How to Cite?: Myong-Hyok Jang, Yong Kim, "Study on a Smoothing and Relaxation Method of Optimization Problem for Clustering of Bibliometric Networks", Volume 5 Issue 12, December 2016, International Journal of Science and Research (IJSR), Pages: 593-597, https://www.ijsr.net/getabstract.php?paperid=ART20163379, DOI: https://dx.doi.org/10.21275/ART20163379