Heuristic methods for large centroid clustering problems
From MaRDI portal
Publication:1402504
DOI10.1023/A:1021841728075zbMath1035.90038OpenAlexW1603665682MaRDI QIDQ1402504
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
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Related Items
Making a state-of-the-art heuristic faster with data mining, A mixed integer linear model for clustering with variable selection, New heuristic algorithms for solving the planar \(p\)-median problem, The \(p\)-median problem: a survey of metaheuristic approaches, Biologically inspired parent selection in genetic algorithms, Continuous maximal covering location problems with interconnected facilities, Design and analysis of hybrid metaheuristics for the reliability \(p\)-median problem, Solving the planar \(p\)-Median problem by variable neighborhood and concentric searches, Incorporating neighborhood reduction for the solution of the planar \(p\)-median problem, A guided reactive GRASP for the capacitated multi-source Weber problem, Heuristic approaches for solid transportation-\(p\)-facility location problem, Combining metaheuristics with mathematical programming, constraint programming and machine learning, An improved column generation algorithm for minimum sum-of-squares clustering, Categorical data fuzzy clustering: an analysis of local search heuristics, POPMUSIC for the travelling salesman problem, Combining metaheuristics with mathematical programming, constraint programming and machine learning, A fast swap-based local search procedure for location problems, A new local search for continuous location problems, Single-source capacitated multi-facility Weber problem-an iterative two phase heuristic algorithm, An aggregation heuristic for large scale p-median problem, A survey of very large-scale neighborhood search techniques, Adaptive memory programming: a unified view of metaheuristics, Hybrid genetic algorithms with selective crossover for the capacitated \(p\)-Median problem, Region-rejection based heuristics for the capacitated multi-source Weber problem, An evolutionary heuristic for quadratic 0-1 programming, Exemplar-based clustering via simulated annealing
Uses Software
