Clustering data that are graph connected

DOI10.1016/J.EJOR.2017.02.009zbMath1403.90630OpenAlexW2587957618MaRDI QIDQ1753555

Antonio M. Rodríguez-Chía, Justo Puerto, Stefano Benati

Publication date: 29 May 2018

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

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

zbMATH Keywords

integer programmingclusteringcombinatorial optimizationclique partitioning

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Applications of graph theory (05C90) Integer programming (90C10) Combinatorial optimization (90C27)

Related Items (14)

Concise integer linear programming formulation for clique partitioning problems ⋮ A mathematical programming approach to overlapping community detection ⋮ Compact formulations for multi-depot routing problems: theoretical and computational comparisons ⋮ Segmentation of scanning-transmission electron microscopy images using the ordered median problem ⋮ Robust optimal classification trees under noisy labels ⋮ Higher order assortativity in complex networks ⋮ A branch-and-cut algorithm for the connected max-\(k\)-cut problem ⋮ Constraint relaxation for the discrete ordered median problem ⋮ Connected graph partitioning with aggregated and non‐aggregated gap objective functions ⋮ Reformulated acyclic partitioning for rail-rail containers transshipment ⋮ Parliament seating assignment problems ⋮ Dominant-set clustering: a review ⋮ Optimization of product category allocation in multiple warehouses to minimize splitting of online supermarket customer orders ⋮ A branch-and-price procedure for clustering data that are graph connected

Uses Software

• CRIO
• Inc-cluster
• SA-cluster

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A three-phased local search approach for the clique partitioning problem
• Looking for edge-equitable spanning trees
• Correlation clustering
• Facets of the clique partitioning polytope
• Variable neighbourhood search: methods and applications
• A cutting plane algorithm for a clustering problem
• The traveling salesman problem: An overview of exact and approximate algorithms
• Min-cut clustering
• Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints
• Clustering large attributed information networks: an efficient incremental computing approach
• Multi-start methods for combinatorial optimization
• Redundant constraints in the standard formulation for the clique partitioning problem
• New bounds and constraint propagation techniques for the clique partitioning problem
• Categorical data fuzzy clustering: an analysis of local search heuristics
• Requiem for the Miller-Tucker-Zemlin subtour elimination constraints?
• Clustering with qualitative information
• OR Forum—An Algorithmic Approach to Linear Regression
• Integer Programming Formulation of Traveling Salesman Problems
• Classification and Regression via Integer Optimization
• Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem

This page was built for publication: Clustering data that are graph connected