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

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.