Mixed-integer models for complete-linkage clustering

DOI10.1007/S10479-025-06872-6MaRDI QIDQ7318280zbMATH OpenFDO

Authors Martine Labbé, Mercedes Landete, Marina Leal, Lorena Nácher

Publication date 24 August 2026

Published in Annals of Operations Research (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S10479-025-06872-6

Mathematics Subject Classification ID

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

Cites work

• A linear programming approach to increasing the weight of all minimum spanning trees
• An introduction to statistical learning. With applications in R
• Cluster analysis and mathematical programming
• Complete-linkage clustering analysis of surrogate measures for road safety assessment in roundabouts
• Dendrograms, minimum spanning trees and feature selection
• Hierarchical means clustering
• Looking for edge-equitable spanning trees
• Mixed integer linear programming formulation for K-means clustering problem
• Network reinforcement
• Solving large p-median problems with a radius formulation
• Solving non-uniqueness in agglomerative hierarchical clustering using multidendrograms
• SOS-SDP: An Exact Solver for Minimum Sum-of-Squares Clustering

This page was built for publication: Mixed-integer models for complete-linkage clustering

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