The Minimum Weight Rooted Aborescence Problem: A Branch and Bound Solution

V. Venkata Rao and Ginnia L F Mc

IIMA Working Papers from Indian Institute of Management Ahmedabad, Research and Publication Department

Abstract: A Subgraph S of a rooted acyclic graph G is called a rooted arborescence if (a) S contains the root as one of its vertices, (2) S is connected, and (3) No two arcs of S are directed towards the same vertex. This paper studies the problem of finding a minimum weight rooted arborescence in a rooted acyclic graph with weights on nodes. This problem is related to the incapacitated plant location problem. A branch and bound method is developed for this problem, and computational results are reported.

Date: 1984-06-01
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

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:iim:iimawp:wp00590

Access Statistics for this paper

More papers in IIMA Working Papers from Indian Institute of Management Ahmedabad, Research and Publication Department Contact information at EDIRC.
Bibliographic data for series maintained by ().