We study the ordered k-median problem, in which the solution is evaluated by
first sorting the client connection costs and then multiplying them with a
predefined non-increasing weight vector (higher connection costs are taken with
larger weights). Since the 1990s, this problem has bee