Maximal Direct Covering Tree Problems

Vicki Aaronson Hutson and Charles S. ReVelle
Additional contact information
Vicki Aaronson Hutson: Abt Associates, Washington, D.C. 20008
Charles S. ReVelle: The Johns Hopkins University, Baltimore, Maryland 21218

Transportation Science, 1989, vol. 23, issue 4, 288-299

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.

Date: 1989
References: Add references at CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.23.4.288 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ortrsc:v:23:y:1989:i:4:p:288-299

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().