The Weber problem is a special case of a facilities location problem : In a basic formulation, the facility location problem consists of a set of potential facility sites L where a facility can be opened, and a set of demand points D that must be serviced. The goal is to pick a subset F of facilities to open, to minimize the sum of distances from each demand point to its nearest facility, plus the sum of opening costs of the facilities (from Wikipedia https://en.wikipedia.org/wiki/Facility_location_problem)
The Weber is the case where there is one facility and n demands (or clients)
The facilities location problem is NP-Hard if there is several facilities but is it still the case in the simpler form of the Weber problem ?