IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v29y1983i4p498-511.html
   My bibliography  Save this article

State of the Art---Location on Networks: A Survey. Part II: Exploiting Tree Network Structure

Author

Listed:
  • Barbaros C. Tansel

    (Georgia Institute of Technology)

  • Richard L. Francis

    (University of Florida)

  • Timothy J. Lowe

    (Purdue University)

Abstract

The discussion of the fundamental p-center and p-median problems in Part I of this paper provides the basis for the work surveyed in Part II. Part II deals with the minimax and minisum location problems with mutual communication, location problems involving multiple objectives, the distance constraints problem and problems involving the location of paths. In addition, convexity issues in network location problems are discussed. Virtually all of this work exploits network structure. Specifically it is based on the assumption that the network is a tree. The conclusion section gives a brief discussion of the state of the art and of current trends in network location research.

Suggested Citation

  • Barbaros C. Tansel & Richard L. Francis & Timothy J. Lowe, 1983. "State of the Art---Location on Networks: A Survey. Part II: Exploiting Tree Network Structure," Management Science, INFORMS, vol. 29(4), pages 498-511, April.
    • Handle: RePEc:inm:ormnsc:v:29:y:1983:i:4:p:498-511
    DOI: 10.1287/mnsc.29.4.498
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.29.4.498
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.29.4.498?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. Owen, Susan Hesse & Daskin, Mark S., 1998. "Strategic facility location: A review," European Journal of Operational Research, Elsevier, vol. 111(3), pages 423-447, December.
    2. Volodymyr V. Sysoiev, 2013. "Optimizing the Number and Location of Warehouses in Logistics Networks Considering the Optimal Delivery Routes and Set Level of Reserve Stock," Theory Methodology Practice (TMP), Faculty of Economics, University of Miskolc, vol. 9(02), pages 85-93.
    3. Kress, Dominik & Pesch, Erwin, 2012. "Sequential competitive location on networks," European Journal of Operational Research, Elsevier, vol. 217(3), pages 483-499.
    4. Mark S. Daskin, 2008. "What you should know about location modeling," Naval Research Logistics (NRL), John Wiley & Sons, vol. 55(4), pages 283-294, June.
    5. João António Zeferino, 2020. "Optimizing the location of aerial resources to combat wildfires: a case study of Portugal," Natural Hazards: Journal of the International Society for the Prevention and Mitigation of Natural Hazards, Springer;International Society for the Prevention and Mitigation of Natural Hazards, vol. 100(3), pages 1195-1213, February.
    6. Gregory Dobson & Euthemia Stavrulaki, 2007. "Simultaneous price, location, and capacity decisions on a line of time‐sensitive customers," Naval Research Logistics (NRL), John Wiley & Sons, vol. 54(1), pages 1-10, February.
    7. Peeters, Peter H., 1998. "Some new algorithms for location problems on networks," European Journal of Operational Research, Elsevier, vol. 104(2), pages 299-309, January.

    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:ormnsc:v:29:y:1983:i:4:p:498-511. 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.