Efficient Algorithms for the (Weighted) Minimum Circle Problem

Donald W. Hearn and James Vijay
Additional contact information
Donald W. Hearn: University of Florida, Gainesville, Florida
James Vijay: University of Florida, Gainesville, Florida

Operations Research, 1982, vol. 30, issue 4, 777-795

Abstract: The (weighted) minimum covering circle problem is a well-known single facility location problem used in emergency facility models. This paper introduces a classification scheme, based on fundamental mathematical programming concepts, for algorithms which solve both weighted and unweighted versions. One result of this classification is proof that a recently developed method is identical to one developed in the nineteenth century. Also, within the classification scheme, efficient new algorithms are given for the weighted problem. The results of some extensive computational tests identify the (empirically) fastest methods.

Keywords: 185 minimax location problem; 649 location problem/geometry problem (search for similar items in EconPapers)
Date: 1982
References: Add references at CitEc
Citations: View citations in EconPapers (14)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.30.4.777 (application/pdf)

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:inm:oropre:v:30:y:1982:i:4:p:777-795

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().