Median Problems in Networks

Vladimir Marianov () and Daniel Serra ()
Additional contact information
Vladimir Marianov: Pontificia Universidad Católica de Chile
Daniel Serra: Pompeu Fabra University

Chapter Chapter 3 in Foundations of Location Analysis, 2011, pp 39-59 from Springer

Abstract: Abstract Suppose a number of geographically distributed customers are demanding a service or good, and facilities providing it need to be optimally located. Once facilities are deployed, either customers travel to the facilities to satisfy their needs, or vehicles travel from the facilities to customers’ locations, carrying the goods to be delivered. The p-median problem finds the optimal location of exactly p facilities, so that the sum of the distances between customers and their closest facilities, measured along the shortest paths, is minimized. Since the number n of customers is known, by dividing the objective by n, the minimum average distance between customers and facilities is obtained too.

Keywords: Facility Location; Demand Point; Demand Node; Node Weight; Single Facility (search for similar items in EconPapers)
Date: 2011
References: Add references at CitEc
Citations: View citations in EconPapers (3)

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_3

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

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

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