IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v122y2003i1p219-23210.1023-a1026154708960.html
   My bibliography  Save this article

Bi-Objective Median Subtree Location Problems

Author

Listed:
  • J.W. George
  • C.S. ReVelle

Abstract

A number of network design problems can be built on the following premise: given an undirected tree network, T, with node set, V, identify a single subtree, t, containing nodes, v, so that the subtree is located optimally with respect to the remaining, subset of unconnected nodes {V−v}. Distances between unconnected nodes and nodes in the subtree t can be defined on paths that are restricted to lie in the larger tree T (the restricted case), or can be defined on paths in an auxiliary complete graph G (the unrestricted case). The unrestricted case represents a class of problems that is not explicitly recognized in the literature, which is of intermediate complexity relative to the widely studied restricted case, and the general problem in which the underlying graph is general. This paper presents the Median Subtree Location Problem (MSLP), formulated as a bicriterion problem that trades off the cost of a subtree, t, against the population-weighted travel distance from the unconnected nodes to nodes on the subtree where both objectives are to be minimized. Integer programs were formulated for the travel restricted and travel unrestricted cases and were tested using linear programming and branch and bound to resolve fractions. Tradeoff curves between cost and travel burden were developed for sample networks. Copyright Kluwer Academic Publishers 2003

Suggested Citation

  • J.W. George & C.S. ReVelle, 2003. "Bi-Objective Median Subtree Location Problems," Annals of Operations Research, Springer, vol. 122(1), pages 219-232, September.
    • Handle: RePEc:spr:annopr:v:122:y:2003:i:1:p:219-232:10.1023/a:1026154708960
    DOI: 10.1023/A:1026154708960
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1023/A:1026154708960
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1023/A:1026154708960?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

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


    Cited by:

    1. Paul, Nicholas R. & Lunday, Brian J. & Nurre, Sarah G., 2017. "A multiobjective, maximal conditional covering location problem applied to the relocation of hierarchical emergency response facilities," Omega, Elsevier, vol. 66(PA), pages 147-158.
    2. Justo Puerto & Federica Ricca & Andrea Scozzari, 2018. "Extensive facility location problems on networks: an updated review," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 26(2), pages 187-226, July.
    3. Justo Puerto & Federica Ricca & Andrea Scozzari, 2018. "Rejoinder on: Extensive facility location problems on networks: an updated review," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 26(2), pages 236-238, July.

    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:annopr:v:122:y:2003:i:1:p:219-232:10.1023/a:1026154708960. 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.