Using Mathematical Programming to Refine Heuristic Solutions for Network Clustering

DOI10.1007/978-3-319-09758-9_2MaRDI QIDQ5265217zbMATH OpenOpenAlexFDO

Authors Sonia Cafieri, Pierre Hansen

Publication date 23 July 2015

Published in Models, Algorithms and Technologies for Network Analysis (Search for Journal in Brave)

Full work available at URL https://hal-enac.archives-ouvertes.fr/hal-01018034/file/Cafieri_NET2013.pdf

zbMATH Keywords

cluster splittinggraph clustering solution

Mathematics Subject Classification ID

Quadratic programming (90C20) Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Mixed integer programming (90C11)

Recommendations

• scientific article; zbMATH DE number 1163449
• Minimization subproblems and heuristics for an applied clustering problem
• Mathematical Programming Formulations for the Bottleneck Hyperplane Clustering Problem
• Cluster analysis and mathematical programming
• scientific article; zbMATH DE number 1003246
• Publication:4488857
• Heuristic search to the capacitated clustering problem
• A heuristic algorithm for solving the minimum sum-of-squares clustering problems
• scientific article; zbMATH DE number 956848
• Optimization solvers and problem formulations for solving data clustering problems

Cites work

• scientific article; zbMATH DE number 437527 (Why is no real title available?)
• scientific article; zbMATH DE number 6180551 (Why is no real title available?)
• A Scalable Multilevel Algorithm for Graph Clustering and Community Structure Detection
• A cutting plane algorithm for a clustering problem
• Collective dynamics of `small-world' networks
• Community structure in social and biological networks
• Facets of the clique partitioning polytope
• Fast unfolding of communities in large networks
• Finding community structures in complex networks using mixed integer optimisation
• Improving heuristics for network modularity maximization using an exact algorithm
• Modularity-maximizing graph communities via mathematical programming
• Networks. An introduction.
• Reformulation of a model for hierarchical divisive graph modularity maximization

Cited in

(2)

• A heuristic for finding embedded network structure in mathematical programmes
• A novel mixed integer linear programming model for clustering relational networks

This page was built for publication: Using Mathematical Programming to Refine Heuristic Solutions for Network Clustering

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