Sum-of-squares clustering on networks (Q2853254)

A continuous p-median problem on a network, taking the minimization of the weighted sum of squared distances between any two nodes as a criterion is considered. The authors extend feasible set of prototypes from a set of nodes to the set of all points in the network. In this case the optimal cluster prototypes are not necessary located at vertices of the network. This property is illustrated by a simple example.