A sampling-based exact algorithm for the solution of the minimax diameter clustering problem

DOI10.1007/s10898-018-0634-1zbMath1402.90207OpenAlexW2792821451WikidataQ130112231 ScholiaQ130112231MaRDI QIDQ721172

Daniel Aloise, Claudio Contardo

Publication date: 18 July 2018

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://publications.polymtl.ca/3251/1/2018_Aloise_Sampling-based_exact_algorithm_solution_minimax.pdf

zbMATH Keywords

large-scale optimizationclusteringdiameter

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Minimax problems in mathematical programming (90C47)

Related Items

A scalable exact algorithm for the vertex \(p\)-center problem ⋮ A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games ⋮ Preface to the special issue ``GOW'16 ⋮ An exact algorithm for a class of geometric set-cover problems ⋮ The conditional \(p\)-dispersion problem

Uses Software

• UCI-ml
• clusfind

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Constrained clustering by constraint programming
• Clustering to minimize the maximum intercluster distance
• Splitting an ordering into a partition to minimize diameter
• A fast algorithm for the maximum clique problem
• Hierarchical clustering schemes
• Bicriterion Cluster Analysis
• Finding Groups in Data
• An efficient algorithm for a complete link method
• A Backward Sampling Framework for Interdiction Problems with Fortification