Project Description

A MINLP solver of high efficiency for size-constrained clustering problems

An algorithm that solves size-constrained clustering problems, finding the global optimum in a much shorter computational time than today’s solutions.

  • Always gives global optimum (correct solution).
  • Computational time is much shorter than existing global MINLP solvers.
  • Can be applied on larger scale problems than previously feasible.
  • Method can be used for clustering problems where clusters have variable sizes (multi-size problems).