A BSSS Algorithm for the Location Problem with Minimum Square Error

Table 1

The results of Example 4.2.

		BSSS				LINGO
case	radius	𝑋𝑏	𝑙𝑏	𝑓𝑏	CPU/sec	𝑋	𝑓
1	(1,1,1,1)	(0.49,0.51)	0.33	0.34	0.34	(1.13,1.13)	1.06
2	(1,2,1,2)	(−0.90,0.51)	0.00	0.00	0.05	(−0.90,0.50)	0.00
3	(2,2,2,2)	(−1.42,0.51)	0.91	0.93	2.53	(1.87,1.87)	1.02