A Lagrangian relaxation algorithm for modularity maximization problem

DOI10.1007/978-3-319-28697-6_34MaRDI QIDQ2806937zbMATH OpenOpenAlexFDO

Authors Kotohumi Inaba, Yoichi Izunaga, Yoshitsugu Yamamoto

Publication date 19 May 2016

Published in Operations Research Proceedings (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/2324/4755278

zbMATH Keywords

set partitioning problemtightly connected nodes

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Recommendations

• A cutting plane algorithm for modularity maximization problem
• A doubly nonnegative relaxation for modularity density maximization
• Modularity-maximizing graph communities via mathematical programming
• Community detection by modularity maximization using GRASP with path relinking
• scientific article; zbMATH DE number 6180551

Cites work

• A dual ascent procedure for the set partitioning problem
• Stabilized column generation

Cited in

(2)

• A doubly nonnegative relaxation for modularity density maximization
• A cutting plane algorithm for modularity maximization problem

This page was built for publication: A Lagrangian relaxation algorithm for modularity maximization problem

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