Heuristic methods for large centroid clustering problems
From MaRDI portal
Publication:1402504
DOI10.1023/A:1021841728075zbMATH Open1035.90038OpenAlexW1603665682MaRDI QIDQ1402504FDOQ1402504
Authors: Éric D. Taillard 
Publication date: 28 August 2003
Published in: Journal of Heuristics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1021841728075
Recommendations
- Approximation schemes for clustering problems
- A heuristic algorithm for solving the minimum sum-of-squares clustering problems
- scientific article; zbMATH DE number 1094767
- Clustering heuristics for set covering
- Heuristic search to the capacitated clustering problem
- An approximation algorithm for a problem of cluster analysis
- Exact and approximation algorithms for clustering
- A heuristic approach to possibilistic clustering. Algorithms and applications
- A matheuristic for large-scale capacitated clustering
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Cited In (35)
- Categorical data fuzzy clustering: an analysis of local search heuristics
- POPMUSIC for the travelling salesman problem
- Optimal partitioning of a data set based on the \(p\)-median model
- Continuous maximal covering location problems with interconnected facilities
- The \(p\)-median problem: a survey of metaheuristic approaches
- Combining metaheuristics with mathematical programming, constraint programming and machine learning
- A guided reactive GRASP for the capacitated multi-source Weber problem
- Incorporating neighborhood reduction for the solution of the planar \(p\)-median problem
- A survey of very large-scale neighborhood search techniques
- Exemplar-based clustering via simulated annealing
- Making a state-of-the-art heuristic faster with data mining
- An improved column generation algorithm for minimum sum-of-squares clustering
- Region-rejection based heuristics for the capacitated multi-source Weber problem
- Effective Heuristic Techniques for Combined Robust Clustering Problem
- Affinity propagation and uncapacitated facility location problems
- The optimality of the centroid method
- An alternating heuristic for medianoid and centroid problems in the plane
- Single-source capacitated multi-facility Weber problem-an iterative two phase heuristic algorithm
- Solving the planar \(p\)-Median problem by variable neighborhood and concentric searches
- Clustering and the perturbed spatial median
- Hybrid genetic algorithms with selective crossover for the capacitated \(p\)-Median problem
- Design and analysis of hybrid metaheuristics for the reliability \(p\)-median problem
- A fast swap-based local search procedure for location problems
- New heuristic algorithms for solving the planar \(p\)-median problem
- Near-optimal large-scale k-medoids clustering
- Biologically inspired parent selection in genetic algorithms
- Solving multiple facilities location problems with separated clusters
- Adaptive memory programming: a unified view of metaheuristics
- An aggregation heuristic for large scale p-median problem
- Title not available (Why is that?)
- A mixed integer linear model for clustering with variable selection
- An evolutionary heuristic for quadratic 0-1 programming
- A new local search for continuous location problems
- Heuristic approaches for solid transportation-\(p\)-facility location problem
- Combining metaheuristics with mathematical programming, constraint programming and machine learning
Uses Software
This page was built for publication: Heuristic methods for large centroid clustering problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1402504)
