International Journal of Science and Research (IJSR)

International Journal of Science and Research (IJSR)
Call for Papers | Fully Refereed | Open Access | Double Blind Peer Reviewed

ISSN: 2319-7064


Downloads: 122 | Views: 210

Research Paper | Mathematics | Korea, North | Volume 5 Issue 12, December 2016 | Rating: 6.4 / 10


Study on a Smoothing and Relaxation Method of Optimization Problem for Clustering of Bibliometric Networks

Myong-Hyok Jang [2] | Yong Kim [3]


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


Edition: Volume 5 Issue 12, December 2016,


Pages: 593 - 597


How to Download this Article?

Type Your Valid Email Address below to Receive the Article PDF Link


Verification Code will appear in 2 Seconds ... Wait

Top