The Multisource Weber problem, also known as the continuous location-allocation problem, or as the Fermat-Weber problem, is considered here. A particular case of the Multisource Weber problem is the minimum sum-of-distances clustering problem, also known as the continuous <InlineEquation ID="IEq1"> <EquationSource Format="TEX">$$p$$</EquationSource> <EquationSource Format="MATHML"> <math xmlns:xlink="http://www.w3.org/1999/xlink"> <mi>p</mi> </math> </EquationSource> </InlineEquation>-median...</equationsource></equationsource></inlineequation>