Continuous Center Problems

Zvi Drezner ()
Additional contact information
Zvi Drezner: California State University-Fullerton

Chapter Chapter 4 in Foundations of Location Analysis, 2011, pp 63-78 from Springer

Abstract: Abstract The minimax facility location problem (also called the one center problem) seeks to locate a facility so that the maximum distance to a set of demand points is minimized. Using Euclidean distances in the plane, this problem is equivalent to finding the center of the smallest circle enclosing all points, hence the term “center” regarding this problem. When other metrics are used, the 1-center problem is equivalent to covering all points with a shape similar to the unit ball of the metric. For example, when rectilinear distances are used, the problem is to cover all points with the smallest possible diamond.

Keywords: Convex Hull; Small Circle; Demand Point; Obtuse Angle; Circle Packing (search for similar items in EconPapers)
Date: 2011
References: Add references at CitEc
Citations: View citations in EconPapers (2)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

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:spr:isochp:978-1-4419-7572-0_4

Ordering information: This item can be ordered from
http://www.springer.com/9781441975720

DOI: 10.1007/978-1-4419-7572-0_4

Access Statistics for this chapter

More chapters in International Series in Operations Research & Management Science from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().