IDEAS home Printed from https://ideas.repec.org/h/spr/isochp/978-1-4419-7572-0_3.html
   My bibliography  Save this book chapter

Median Problems in Networks

In: Foundations of Location Analysis

Author

Listed:
  • Vladimir Marianov

    (Pontificia Universidad Católica de Chile)

  • Daniel Serra

    (Pompeu Fabra University)

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.

Suggested Citation

  • Vladimir Marianov & Daniel Serra, 2011. "Median Problems in Networks," International Series in Operations Research & Management Science, in: H. A. Eiselt & Vladimir Marianov (ed.), Foundations of Location Analysis, chapter 0, pages 39-59, Springer.
    • Handle: RePEc:spr:isochp:978-1-4419-7572-0_3
    DOI: 10.1007/978-1-4419-7572-0_3
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Mehrnaz Bathaee & Hamed Nozari & Agnieszka Szmelter-Jarosz, 2023. "Designing a New Location-Allocation and Routing Model with Simultaneous Pick-Up and Delivery in a Closed-Loop Supply Chain Network under Uncertainty," Logistics, MDPI, vol. 7(1), pages 1-33, January.
    2. Janghoon Yang, 2015. "Generalized key player problem," Computational and Mathematical Organization Theory, Springer, vol. 21(1), pages 24-47, March.
    3. Burkey, M.L. & Bhadury, J. & Eiselt, H.A., 2012. "A location-based comparison of health care services in four U.S. states with efficiency and equity," Socio-Economic Planning Sciences, Elsevier, vol. 46(2), pages 157-163.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:isochp:978-1-4419-7572-0_3. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.