Norm statistics and the complexity of clustering problems
From MaRDI portal
Publication:1026145
DOI10.1016/j.dam.2009.01.003zbMath1169.91019OpenAlexW2022786090MaRDI QIDQ1026145
Publication date: 24 June 2009
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2009.01.003
Related Items (2)
Exact algorithms for size constrained 2-clustering in the plane ⋮ On the complexity of redescription mining
Uses Software
Cites Work
- A projection method for \(l_ p\) norm location-allocation problems
- Variable neighborhood search
- On Grouping for Maximum Homogeneity
- Solving thep-Center problem with Tabu Search and Variable Neighborhood Search
- Optimal Locations for a Class of Nonlinear, Single-Facility Location Problems on a Network
- Integer Programming and the Theory of Grouping
- Cluster Analysis and Mathematical Programming
- J-MEANS: A new local search heuristic for minimum sum of squares clustering
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Norm statistics and the complexity of clustering problems