@techreport{oai:tsukuba.repo.nii.ac.jp:00029358,
 author = {IZUNAGA, Yoichi and YAMAMOTO, Yoshitsugu and 山本, 芳嗣},
 month = {Jul},
 note = {The modularity proposed by Newman and Girvan is the most commonly used measure when the nodes of a graph are grouped into communities consisting of tightly connected
nodes. We formulate the modularity maximization problem as a set partitioning problem, and propose an algorithm for the problem based on the linear programming relaxation. We solve the dual of the linear programming relaxation by using a cutting plane method. To mediate the slow convergence that cutting plane methods usually suffer, we propose a method for finding and simultaneously adding multiple cutting planes which may complement well each other.},
 title = {A cutting plane algorithm for Modularity maximization with heuristics for separation problem},
 year = {2013}
}