IDEAS home Printed from https://ideas.repec.org/a/ids/ijmore/v12y2018i3p317-330.html
   My bibliography  Save this article

An exact algorithm for multi-constrained minimum spanning tree problem

Author

Listed:
  • T. Jayanth Kumar
  • Purusotham Singamsetty

Abstract

This paper deals with a variant of minimum spanning tree problem with multiple constraints, which includes degree, weight and budgeting constraints simultaneously together. To model the problem, a zero-one programming is incorporated. An exact solution procedure called pattern recognition technique-based lexi-search algorithm is developed. A suitable numerical illustration is given to check the applicability of the developed algorithm. Furthermore, the algorithm is programmed in C and tested with randomly generated hard instances, computational results are also reported. The overall results reveal that the proposed algorithm is fairly proficient in the sense of both acquiring the optimal solutions and computational time.

Suggested Citation

  • T. Jayanth Kumar & Purusotham Singamsetty, 2018. "An exact algorithm for multi-constrained minimum spanning tree problem," International Journal of Mathematics in Operational Research, Inderscience Enterprises Ltd, vol. 12(3), pages 317-330.
    • Handle: RePEc:ids:ijmore:v:12:y:2018:i:3:p:317-330
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=90800
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:ids:ijmore:v:12:y:2018:i:3:p:317-330. 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=320 .

    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.