IDEAS home Printed from https://ideas.repec.org/p/iim/iimawp/wp01106.html
   My bibliography  Save this paper

The Minimum Weight Rooted Arborescence Problem: Weights on ARCS Case

Author

Listed:
  • Venkata Rao, V.
  • Sridharan R

Abstract

In a rooted acyclic graph, G, there exits, in general, several rooted (not necessarily spanning) arborscences. Depending on whether the graph has weights on nodes, on arcs, or on both, it is possible to define, with different objective functions, several different problems, each concerned with finding an optimal rooted arborscence in the graph under consideration. Of the different types of rooted acyclic graphs, we are in particular interested in two: 1. rooted acyclic graph Gn with weights on nodes, and 2.rooted acyclic graph Ga with weights on arcs. In the first category, an optimal rooted arborsence can be defined as one whose sum of node weights is less than or equal to that of any other rooted arborscence in Gn, the problem of finding such an arborscence is called the minimum rooted arborscence (MRA(Gn)) problem in an acyclic rooted graph with weights on nodes. Similarly, in the second category, an optimal rooted arborscence can be defined as one whose sum of arc weights is less than or equal to that of any other rooted arborscence in Ga; the corresponding problem is called the minimum rooted arborscence (MRA(Ga)) problem in a rooted acyclic graph with weights on arcs. The MRA(Gn) has already been studied. The objective of this paper is to explore the relation between (MRA(Ga) and MRA(Gn) problems, and to propose approximate and exact methods for solving MRA(Ga) problem. However, the paper presents no computational results, as the programming of the proposed algorithms is still in progress. After discussing the relation between the MRA(Gn) and MRA(Ga) problems, we formulate the MRA(Ga) problem as a zero-one programming problem, and discuss a heuristic to construct a rooted arborscence RA in any given Ga. This heuristic can be used to generate an upper bound on the value of the objective function for MRA(Ga). We also discuss the formulation of a Lagrangian Dual of MRA(Ga) problem and present a linear relaxation of MRA(Ga). Finally, we present a branch and bound scheme for the MRA(Ga) problem.

Suggested Citation

  • Venkata Rao, V. & Sridharan R, 1992. "The Minimum Weight Rooted Arborescence Problem: Weights on ARCS Case," IIMA Working Papers WP1992-05-01_01106, Indian Institute of Management Ahmedabad, Research and Publication Department.
    • Handle: RePEc:iim:iimawp:wp01106
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Ritt, Marcus & Pereira, Jordi, 2020. "Heuristic and exact algorithms for minimum-weight non-spanning arborescences," European Journal of Operational Research, Elsevier, vol. 287(1), pages 61-75.

    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:iim:iimawp:wp01106. 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: the person in charge (email available below). General contact details of provider: https://edirc.repec.org/data/eciimin.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.