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

Maximal Direct Covering Tree Problems

Author

Listed:
  • Vicki Aaronson Hutson

    (Abt Associates, Washington, D.C. 20008)

  • Charles S. ReVelle

    (The Johns Hopkins University, Baltimore, Maryland 21218)

Abstract

Concepts of coverage are extended to a problem of network design. Maximal covering tree problems are introduced to widen the applicability of the minimal spanning tree (MST), a classic network design problem, which defines the minimal length connection of all nodes in a network. Maximal covering tree problems relax the restriction that all nodes must be connected. Instead, maximal covering tree problems identify the best choices for subtrees in the spanning tree network based on the relative benefits and costs of connecting nodes. Two-objective integer programming (IP) models are formulated and solved for the maximal direct covering tree (1) on spanning networks in which arcs currently exist and (2) for the general spanning tree graph.

Suggested Citation

  • Vicki Aaronson Hutson & Charles S. ReVelle, 1989. "Maximal Direct Covering Tree Problems," Transportation Science, INFORMS, vol. 23(4), pages 288-299, November.
    • Handle: RePEc:inm:ortrsc:v:23:y:1989:i:4:p:288-299
    DOI: 10.1287/trsc.23.4.288
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.23.4.288
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.23.4.288?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. T. Boffey, 1998. "Efficient solution methods for covering tree problems," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 6(2), pages 205-221, December.
    2. Timothy J. Niblett & Richard L. Church, 2016. "The Shortest Covering Path Problem," International Regional Science Review, , vol. 39(1), pages 131-151, January.
    3. Mesa, Juan A. & Brian Boffey, T., 1996. "A review of extensive facility location in networks," European Journal of Operational Research, Elsevier, vol. 95(3), pages 592-603, December.
    4. Moreno Perez, Jose A. & Marcos Moreno-Vega, J. & Rodriguez Martin, Inmaculada, 2003. "Variable neighborhood tabu search and its application to the median cycle problem," European Journal of Operational Research, Elsevier, vol. 151(2), pages 365-378, December.

    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:23:y:1989:i:4:p:288-299. 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.