MAXIMAL DIRECT COVERING TREE PROBLEMS

In this paper, the concept of the maximal covering tree problem is introduced to optimize the benefits of linking only certain nodes in a network. The best choices for subtrees in the spanning tree network are identified by the maximal covering tree problem based on the relative benefits and costs of connecting nodes. Two-objective integer programming 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.

• Availability:
  • Find a library where document is available. Order URL: https://www.library.northwestern.edu/find-borrow-request/requests-interlibrary-loan/lending-institutions.html
• Authors:
  • HUTSON, V A
  • ReVelle, C S
• Publication Date: 1989-11

Media Info

• Features: Figures; References; Tables;
• Pagination: p. 288-299
• Serial:
  • Transportation Science
  • Issue Number: 4
  • Publisher: Institute for Operations Research and the Management Sciences (INFORMS)
  • ISSN: 0041-1655
  • Serial URL: http://transci.journal.informs.org/

Subject/Index Terms

• TRT Terms: Highway design; Integer programming; Mathematical models; Optimization
• Old TRIS Terms: Maximal covering tree problems
• Subject Areas: Design; Highways; Planning and Forecasting; I21: Planning of Transport Infrastructure;

Filing Info

• Accession Number: 00490621
• Record Type: Publication
• Files: TRIS
• Created Date: Jan 31 1990 12:00AM