IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v20y1986i3p213-219.html
   My bibliography  Save this article

Network Median Problems with Continuously Distributed Demand

Author

Listed:
  • Paul T. Nkansah

    (Atlanta University, Atlanta, Georgia, and Iowa State University, Ames, Iowa)

  • H. T. David

    (Iowa State University, Ames, Iowa)

Abstract

The network p -median (supply point location) problem has been generalized to the case where demand is continuously distributed. For p = 1 and uniformly distributed demand, and with the objective of minimizing distance, the interior points of an “edge” may be omitted from the search for an optimal supply point when that edge belongs to a “circuit.” Analogous conditions apply when demand is distributed in other than uniform fashion, and/or the objective is to minimize various forms of travel cost. In the case of p (ge) 2, with uniformly distributed demand and with the objective of minimizing distance, p -tuples of supply points, whose components are, respectively, interior points of p “mutually distant” edges, can be omitted from the search for p optimal supply points.

Suggested Citation

  • Paul T. Nkansah & H. T. David, 1986. "Network Median Problems with Continuously Distributed Demand," Transportation Science, INFORMS, vol. 20(3), pages 213-219, August.
    • Handle: RePEc:inm:ortrsc:v:20:y:1986:i:3:p:213-219
    DOI: 10.1287/trsc.20.3.213
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.20.3.213
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.20.3.213?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

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


    Cited by:

    1. Rafael Blanquero & Emilio Carrizosa, 2013. "Solving the median problem with continuous demand on a network," Computational Optimization and Applications, Springer, vol. 56(3), pages 723-734, December.

    More about this item

    Statistics

    Access and download statistics

    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:inm:ortrsc:v:20:y:1986:i:3:p:213-219. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.