A CUTTING PLANE ALGORITHM FOR MODULARITY MAXIMIZATION PROBLEM

DOI10.15807/JORSJ.60.24zbMATH Open1371.90033OpenAlexW2584022088MaRDI QIDQ5267565FDOQ5267565

Yoichi Izunaga, Yoshitsugu Yamamoto

Publication date: 13 June 2017

Published in: Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.15807/jorsj.60.24

zbMATH Keywords

combinatorial optimizationcommunity detectioncutting planesset partitioningmodularity maximization

Mathematics Subject Classification ID

Linear programming (90C05) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)

Cited In (3)

• An enhanced MILP-based branch-and-price approach to modularity density maximization on graphs
• A study on modularity density maximization: column generation acceleration and computational complexity analysis
• Comprehensive decomposition optimization method for locating key sets of commenters spreading conspiracy theory in complex social networks

This page was built for publication: A CUTTING PLANE ALGORITHM FOR MODULARITY MAXIMIZATION PROBLEM

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5267565)