A sampling-based exact algorithm for the solution of the minimax diameter clustering problem
type: Item
instance of: scholarly article
title: A sampling-based exact algorithm for the solution of the minimax diameter clustering problem
zbMATH Open document ID: 1402.90207
author: Daniel Aloise
author: Claudio Contardo
published in: Journal of Global Optimization
publication date: 2018-07-18T00:00:00Z
full work available at URL: 2018 Aloise Sampling-based exact algorithm solution minimax.pdf
Mathematics Subject Classification ID: 90C47
Mathematics Subject Classification ID: 90C06
zbMATH DE Number: 6905236
zbMATH Keywords: clustering
zbMATH Keywords: diameter
zbMATH Keywords: large-scale optimization
describes a project that uses: UCI-ml
describes a project that uses: clusfind
MaRDI profile type: Publication
OpenAlex ID: W2792821451
cites work: A Backward Sampling Framework for Interdiction Problems with Fortification
cites work: Splitting an ordering into a partition to minimize diameter
cites work: Q4054519
cites work: Q5706832
cites work: Constrained clustering by constraint programming
cites work: An efficient algorithm for a complete link method
cites work: Bicriterion Cluster Analysis
cites work: Q4198056
cites work: Clustering to minimize the maximum intercluster distance
cites work: Q3869362
cites work: Hierarchical clustering schemes
cites work: Finding Groups in Data
cites work: A fast algorithm for the maximum clique problem
Wikidata QID: Q130112231
DOI: 10.1007/S10898-018-0634-1
description: scientific article; zbMATH DE number 6905236