Discrete Center Problems

Barbaros Ç. Tansel ()
Additional contact information
Barbaros Ç. Tansel: Bilkent University

Chapter Chapter 5 in Foundations of Location Analysis, 2011, pp 79-106 from Springer

Abstract: Abstract Our focus in this chapter is on discrete center location problems. This class of problems involves locating one or more facilities on a network to service a set of demand points at known locations in such a way that every demand receives its service from a closest facility, and the maximum distance between a demand and a closest facility is as small as possible. This leads to a minimax type of objective function, which is intrinsically different from the minisum objective that is more widely encountered in location models, for which the primary concern is to minimize the total transportation cost. The term discrete in the title refers to a finite set of demand points, while continuous versions of center location problems are also possible if the set of demand points to be served constitutes a continuum of points on the network under consideration.

Keywords: Demand Point; Tree Network; Weighted Case; Localization Theorem; Unweighted Case (search for similar items in EconPapers)
Date: 2011
References: Add references at CitEc
Citations:

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_5

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

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

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 ().