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

DOI10.1016/j.ins.2021.11.048OpenAlexW3217163146MaRDI QIDQ6149519

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

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

metaheuristicsGRASPinfeasibilitystrategic oscillationbalanced clustering

Mathematics Subject Classification ID

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

Cites Work

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

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