A BSSS Algorithm for the Location Problem with Minimum Square Error | Zendy

Jafar Fathali | Zendy; Mehdi Zaferanieh | Zendy; Ahmad Nezakati | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A BSSS Algorithm for the Location Problem with Minimum Square Error

Author(s) -

Jafar Fathali,

Mehdi Zaferanieh,

Ahmad Nezakati

Publication year - 2009

Publication title -

advances in operations research

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.379

H-Index - 14

eISSN - 1687-9155

pISSN - 1687-9147

DOI - 10.1155/2009/212040

Subject(s) - square (algebra) , point (geometry) , ideal (ethics) , radius , hull , facility location problem , ideal point , mathematical optimization , plane (geometry) , computer science , mathematics , algorithm , 1 center problem , geometry , engineering , philosophy , computer security , epistemology , marine engineering

Let weighted points be given in the plane 2. For each pointa radius is given which is the expected ideal distance from this pointto a new facility. We want to find the location of a new facility suchthat the sum of the weighted errors between the existing points andthis new facility is minimized. This is in fact a nonconvex optimization problem. We show that the optimal solution lies in an extended rectangular hull of the existing points. Based on this finding then anefficient big square small square (BSSS) procedure is proposed

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research