Complete mixed integer linear programming formulations for modularity density based clustering
type: Item
instance of: scholarly article
title: Complete mixed integer linear programming formulations for modularity density based clustering
zbMATH Open document ID: 1387.90154
author: Lin~Xuan Foo
author: Alberto Costa
author: Tsan Sheng Ng
published in: Discrete Optimization
publication date: 2018-05-24T00:00:00Z
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 6872142
zbMATH Keywords: clustering
zbMATH Keywords: modularity density
zbMATH Keywords: mixed integer linear programming
zbMATH Keywords: reformulations
describes a project that uses: SCIP
describes a project that uses: CPLEX
MaRDI profile type: Publication
full work available at URL: j.disopt.2017.03.002
OpenAlex ID: W2607708778
cites work: Community structure in social and biological networks
cites work: MILP formulations for the modularity density maximization problem
cites work: A convex envelope formula for multilinear functions
cites work: Existence and sum decomposition of vertex polyhedral convex envelopes
cites work: Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
cites work: L’algebre de Boole et ses applications en recherche operationnelle
cites work: Q4464676
cites work: Trilinear monomials with mixed sign domains: Facets of the convex and concave envelopes
cites work: On the impact of symmetry-breaking constraints on spatial branch-and-bound for circle packing in a square
cites work: Overlapping community detection in networks
cites work: Graph-based data clustering with overlaps
cites work: SCIP: solving constraint integer programs
cites work: Divisive heuristic for modularity density maximization
DOI: 10.1016/J.DISOPT.2017.03.002
description: scientific article; zbMATH DE number 6872142