IDEAS home Printed from https://ideas.repec.org/h/spr/isochp/978-1-4419-7572-0_14.html
   My bibliography  Save this book chapter

Exploiting Structure: Location Problems on Trees and Treelike Graphs

In: Foundations of Location Analysis

Author

Listed:
  • Rex K. Kincaid

    (The College of William and Mary)

Abstract

Posing location problems on graphs or networks has sharpened our understanding of what underlying structures can be exploited to prove theorems and to develop efficient algorithms. The construction of efficient algorithms for network location problems has been greatly aided by the work of computer scientists who have devised algorithms and data structures that allow efficient traversal and storage of graphs. In this chapter the contributions of three early location analysis papers are examined in detail. Key ideas are identified and their effects traced forward through the literature. In addition, natural extensions of these key ideas are included. However, no attempt is made to be encyclopedic when surveying the literature. The chapter concludes with comments on future research directions.

Suggested Citation

  • Rex K. Kincaid, 2011. "Exploiting Structure: Location Problems on Trees and Treelike Graphs," International Series in Operations Research & Management Science, in: H. A. Eiselt & Vladimir Marianov (ed.), Foundations of Location Analysis, chapter 0, pages 315-334, Springer.
    • Handle: RePEc:spr:isochp:978-1-4419-7572-0_14
    DOI: 10.1007/978-1-4419-7572-0_14
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Kress, Dominik & Pesch, Erwin, 2012. "Sequential competitive location on networks," European Journal of Operational Research, Elsevier, vol. 217(3), pages 483-499.

    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:spr:isochp:978-1-4419-7572-0_14. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.