A faster algorithm for the two cluster partitioning problem
From MaRDI portal
Computational aspects of data analysis and big data (68T09) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59)
This page was built for publication: A faster algorithm for the two cluster partitioning problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6949733)
