IDEAS home Printed from https://ideas.repec.org/a/wly/navlog/v33y1986i4p775-787.html
   My bibliography  Save this article

Bounding methods for facilities location algorithms

Author

Listed:
  • Paul D. Dowling
  • Robert F. Love

Abstract

Single‐ and multi‐facility location problems are often solved with iterative computational procedures. Although these procedures have proven to converage, in practice it is desirable to be able to compute a lower bound on the objective function at each iteration. This enables the user to stop the iterative process when the objective function is within a prespecified tolerance of the optimum value. In this article we generalize a new bounding method to include multi‐facility problems with lp distances. A proof is given that for Euclidean distance problems the new bounding procedure is superior to two other known methods. Numerical results are given for the three methods.

Suggested Citation

  • Paul D. Dowling & Robert F. Love, 1986. "Bounding methods for facilities location algorithms," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 33(4), pages 775-787, November.
    • Handle: RePEc:wly:navlog:v:33:y:1986:i:4:p:775-787
    DOI: 10.1002/nav.3800330420
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.3800330420
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nav.3800330420?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:wly:navlog:v:33:y:1986:i:4:p:775-787. 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1931-9193 .

    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.