A bisection method for solving distance-based clustering problems globally

DOI10.1007/S11750-024-00684-WMaRDI QIDQ6913491zbMATH OpenFDO

Authors Peter Kirst, Tomáš Bajbar, Mario Merkel

Publication date 21 October 2025

Published in Top (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

global optimizationbisection methodmaximal cliqueclustering problem\(k\)-means problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)

This page was built for publication: A bisection method for solving distance-based clustering problems globally

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