Complete mixed integer linear programming formulations for modularity density based clustering

DOI10.1016/j.disopt.2017.03.002zbMath1387.90154OpenAlexW2607708778MaRDI QIDQ1751238

Lin~Xuan Foo, Tsan Sheng Ng, Alberto L. C. Costa

Publication date: 24 May 2018

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2017.03.002

zbMATH Keywords

clusteringmixed integer linear programmingreformulationsmodularity density

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Mixed integer programming (90C11)

Related Items (4)

Limiting flexibility in nonparametric efficiency evaluations: an ex post \(k\)-centroid clustering approach ⋮ 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 ⋮ Modified modularity density maximization and density ratio heuristic

Uses Software

• SCIP
• CPLEX

Cites Work

• MILP formulations for the modularity density maximization problem
• Divisive heuristic for modularity density maximization
• Graph-based data clustering with overlaps
• SCIP: solving constraint integer programs
• Existence and sum decomposition of vertex polyhedral convex envelopes
• A convex envelope formula for multilinear functions
• On the impact of symmetry-breaking constraints on spatial branch-and-bound for circle packing in a square
• Trilinear monomials with mixed sign domains: Facets of the convex and concave envelopes
• L’algebre de Boole et ses applications en recherche operationnelle
• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
• Community structure in social and biological networks
• Overlapping community detection in networks
• Unnamed Item

This page was built for publication: Complete mixed integer linear programming formulations for modularity density based clustering