IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v14y1980i2p107-124.html
   My bibliography  Save this article

Binding Inequalities for Tree Network Location Problems with Distance Constraints

Author

Listed:
  • Barbaros C. Tansel

    (University of Florida, Gainesville, Florida)

  • Richard L. Francis

    (University of Florida, Gainesville, Florida)

  • Timothy J. Lowe

    (Purdue University, West Lafayette, Indiana)

Abstract

In this paper, we consider the problem of finding locations of several new facilities in an imbedded tree network with respect to existing facilities at known locations so as to satisfy distance constraints, which impose upper bounds on distances between pairs of facilities. It is known that the existence of a feasible solution to the distance constraints is related to shortest paths through an auxiliary network. The arc lengths in this auxiliary network are the upper bounds on pairwise facility distances. This relationship takes the form of necessary and sufficient conditions, termed the separation conditions. We relate “tight” separation conditions to the solution of multifacility minimax location problems and efficient solutions to multiobjective multifacility location problems. In addition, we demonstrate how the multiobjective results provide insight into the question of lowest computational order of an algorithm for determining whether or not the distance constraints are consistent.

Suggested Citation

  • Barbaros C. Tansel & Richard L. Francis & Timothy J. Lowe, 1980. "Binding Inequalities for Tree Network Location Problems with Distance Constraints," Transportation Science, INFORMS, vol. 14(2), pages 107-124, May.
    • Handle: RePEc:inm:ortrsc:v:14:y:1980:i:2:p:107-124
    DOI: 10.1287/trsc.14.2.107
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.14.2.107
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.14.2.107?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. Hakimi, S.Louis, 1983. "Network location theory and contingency planning," Energy, Elsevier, vol. 8(8), pages 697-702.

    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:ortrsc:v:14:y:1980:i:2:p:107-124. 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.