A BSSS Algorithm for the Location Problem with Minimum Square Error

Jafar Fathali, Mehdi Zaferanieh and Ahmad Nezakati

Advances in Operations Research, 2009, vol. 2009, 1-10

Abstract:

Let ð ‘› weighted points be given in the plane ð ‘… 2 . 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.

Date: 2009
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/AOR/2009/212040.pdf (application/pdf)
http://downloads.hindawi.com/journals/AOR/2009/212040.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlaor:212040

DOI: 10.1155/2009/212040

Access Statistics for this article

More articles in Advances in Operations Research from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().