IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v28y1980i5p1112-1121.html
   My bibliography  Save this article

A Dual-Bounded Algorithm for the p -Median Problem

Author

Listed:
  • Roberto D. Galvão

    (Institute de Matemática, UFRJ, Rio de Janeiro, Brazil)

Abstract

The p -median problem consists of locating p facilities on a network, so that the sum of shortest distances from each of the nodes of the network to its nearest facility is minimized. A dual bound, based on the dual of the LP relaxation of the integer programming formulation of the problem, is developed and tested in a branch-and-bound algorithm. Computational results show that the resulting solution procedure has some advantages over existing exact methods for this problem.

Suggested Citation

  • Roberto D. Galvão, 1980. "A Dual-Bounded Algorithm for the p -Median Problem," Operations Research, INFORMS, vol. 28(5), pages 1112-1121, October.
    • Handle: RePEc:inm:oropre:v:28:y:1980:i:5:p:1112-1121
    DOI: 10.1287/opre.28.5.1112
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.28.5.1112
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.28.5.1112?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
    ---><---

    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:oropre:v:28:y:1980:i:5:p:1112-1121. 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.