IDEAS home Printed from
   My bibliography  Save this article

Analysis and computational schemes for p-median heuristics


  • M Horn


This paper is concerned with solution procedures for the p-median problem: the well-established heuristic of Teitz and Bail, and the GRIA (Global/Regional Interchange Algorithm) technique developed more recently by Densham and Rushton. A computational scheme is presented which facilitates efficient implementations in both cases. The mathematical basis for the computational scheme is explained concisely by means of set-theory notation, and implementation of the Teitz - Bart heuristic is discussed with particular reference to search and storage considerations in large networks and in trees. In addition, it is shown that the two procedures in general do not terminate at solutions of equivalent local optimality.

Suggested Citation

  • M Horn, 1996. "Analysis and computational schemes for p-median heuristics," Environment and Planning A, Pion Ltd, London, vol. 28(9), pages 1699-1708, September.
  • Handle: RePEc:pio:envira:v:28:y:1996:i:9:p:1699-1708

    Download full text from publisher

    File URL:
    File Function: abstract
    Download Restriction: Fulltext access restricted to subscribers, see for details

    File URL:
    File Function: main text
    Download Restriction: Fulltext access restricted to subscribers, see for details

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item


    Access and download statistics


    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:pio:envira:v:28:y:1996:i:9:p:1699-1708. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Neil Hammond). General contact details of provider: .

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

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

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.