## Exact Solutions for the NP-hard Wasserstein Barycenter Problem using a Doubly Nonnegative Relaxation and a Splitting Method

\(\) The simplified Wasserstein barycenter problem, also known as the cheapest hub problem, consists in selecting one point from each of \(k\) given sets, each set consisting of \(n\) points, with the aim of minimizing the sum of distances to the barycenter of the \(k\) chosen points. This problem is also known as the cheapest … Read more