MILP formulations for the modularity density maximization problem

DOI10.1016/j.ejor.2015.03.012zbMath1346.05266OpenAlexW1975308300MaRDI QIDQ319514

Alberto L. C. Costa

Publication date: 6 October 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2015.03.012

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Mixed integer programming (90C11)

Related Items (11)

Concise integer linear programming formulation for clique partitioning problems ⋮ Exact computational solution of modularity density maximization by effective column generation ⋮ Divisive heuristic for modularity density maximization ⋮ Modularity maximization to design contiguous policy zones for pandemic response ⋮ A study on modularity density maximization: column generation acceleration and computational complexity analysis ⋮ An enhanced MILP-based branch-and-price approach to modularity density maximization on graphs ⋮ Complete mixed integer linear programming formulations for modularity density based clustering ⋮ Efficient modularity density heuristics for large graphs ⋮ Two-mode modularity clustering of parts and activities for cell formation problems ⋮ A doubly nonnegative relaxation for modularity density maximization ⋮ Modified modularity density maximization and density ratio heuristic

This page was built for publication: MILP formulations for the modularity density maximization problem