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.

Media Info

Subject/Index Terms

Filing Info

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