A BSSS Algorithm for the Location Problem with Minimum Square Error
Joint Authors
Zaferanieh, Mehdi
Nezakati, Ahmad
Fathali, Jafar
Source
Advances in Operations Research
Issue
Vol. 2009, Issue 2009 (31 Dec. 2009), pp.1-10, 10 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2009-12-31
Country of Publication
Egypt
No. of Pages
10
Main Subjects
Information Technology and Computer Science
Abstract EN
Let n weighted points be given in the plane R2.
For each point a radius is given which is the expected ideal distance from this point to a new facility.
We want to find the location of a new facility such that the sum of the weighted errors between the existing points and this 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 an efficient big square small square (BSSS) procedure is proposed.
American Psychological Association (APA)
Fathali, Jafar& Zaferanieh, Mehdi& Nezakati, Ahmad. 2009. A BSSS Algorithm for the Location Problem with Minimum Square Error. Advances in Operations Research،Vol. 2009, no. 2009, pp.1-10.
https://search.emarefa.net/detail/BIM-454893
Modern Language Association (MLA)
Fathali, Jafar…[et al.]. A BSSS Algorithm for the Location Problem with Minimum Square Error. Advances in Operations Research No. 2009 (2009), pp.1-10.
https://search.emarefa.net/detail/BIM-454893
American Medical Association (AMA)
Fathali, Jafar& Zaferanieh, Mehdi& Nezakati, Ahmad. A BSSS Algorithm for the Location Problem with Minimum Square Error. Advances in Operations Research. 2009. Vol. 2009, no. 2009, pp.1-10.
https://search.emarefa.net/detail/BIM-454893
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-454893
