Strategic oscillation for the balanced minimum sum-of-squares clustering problem

DOI10.1016/J.INS.2021.11.048MaRDI QIDQ6149519zbMATH OpenOpenAlexFDO

Authors R. Martín-Santamaría, Jesús Sánchez-Oro, Sergio Pérez-Peló, Abraham Duarte

Publication date 5 February 2024

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ins.2021.11.048

zbMATH Keywords

balanced clusteringGRASPinfeasibilitymetaheuristicsstrategic oscillation

Mathematics Subject Classification ID

Statistics (62-XX) Computer science (68-XX)

Cites work

• A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set
• A probabilistic heuristic for a computationally difficult set covering problem
• Design of balanced MBA student teams
• Hierarchical clustering with optimal transport
• scientific article; zbMATH DE number 6381735 (Why is no real title available?)
• scientific article; zbMATH DE number 3129892 (Why is no real title available?)
• scientific article; zbMATH DE number 3761400 (Why is no real title available?)
• scientific article; zbMATH DE number 3231692 (Why is no real title available?)
• Influential features PCA for high dimensional clustering
• Scheduling workover rigs for onshore oil production
• Solving the minimum sum-of-squares clustering problem by hyperbolic smoothing and partition into boundary and gravitational regions
• Tabu search for the dynamic bipartite drawing problem
• The case for strategic oscillation
• The Planar k-Means Problem is NP-Hard
• TTT plots: a perl program to create time-to-target plots

Cited in

(1)

• On the automatic generation of metaheuristic algorithms for combinatorial optimization problems

This page was built for publication: Strategic oscillation for the balanced minimum sum-of-squares clustering problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6149519)