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

Solving Nonlinear Single-Facility Network Location Problems

Author

Listed:
  • John Hooker

    (Carnegie-Mellon University, Pittsburgh, Pennsylvania)

Abstract

We present a general approach to solving nonlinear single-facility network location problems. We assume that cost is any convex function of distances, and solve this class of problem by solving convex subproblems on “treelike segments” into which the network is decomposed. We show that only a fraction of treelike segments generally need be examined, and that our method results in a reasonably efficient general-purpose algorithm. The algorithm is particularly effective on real-world (as opposed to random) networks, and when the cost function is nondecreasing and “semiseparable,” as are many popular cost functions. Finally, we describe theoretical complexity bounds and computational experience.

Suggested Citation

  • John Hooker, 1986. "Solving Nonlinear Single-Facility Network Location Problems," Operations Research, INFORMS, vol. 34(5), pages 732-743, October.
    • Handle: RePEc:inm:oropre:v:34:y:1986:i:5:p:732-743
    DOI: 10.1287/opre.34.5.732
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.34.5.732
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.34.5.732?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. Igor Averbakh & Oded Berman, 2000. "Minmax Regret Median Location on a Network Under Uncertainty," INFORMS Journal on Computing, INFORMS, vol. 12(2), pages 104-110, May.

    More about this item

    Keywords

    185; 481 location on networks;

    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:34:y:1986:i:5:p:732-743. 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.