IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v86y1999i0p271-29410.1023-a1018911003529.html
   My bibliography  Save this article

The Capacitated Minimal Spanning Tree Problem: An experiment with a hop‐indexedmodel

Author

Listed:
  • L. Gouveia
  • P. Martins

Abstract

The Capacitated Minimal Spanning Tree Problem (CMSTP) is to find a minimal spanningtree with an additional cardinality constraint on the size of the subtrees off of a given rootnode. This problem is closely related to the design of centralized networks where one wantsto link, with minimum cost, several terminals to a given root node (typically, a concentratoror a computer center). In this paper, we present a new extended and compact formulationfor the CMSTP. This formulation is a “hop‐indexed” single‐commodity flow model andgeneralizes a well‐known single‐commodity flow model. We introduce a new set of validinequalities, denoted by “hop ordering” inequalities, which are not redundant for the LPrelaxation of the new formulation. We present a new cutting plane method for the CMSTPwith the new formulation as the initial model and using constraint generation for adding“hop‐ordering” constraints and generalized subtour elimination constraints to the currentLP model. We present computational results from a set of tests with 40 and 80 nodes whichcompare our lower bounds with the bounds given by other known methods. The main contributionof our proposed method is to considerably close previously known gaps for testswhich have been classified as hard ones, namely tightly capacitated tests with the root in thecorner of the grid of points. Copyright Kluwer Academic Publishers 1999

Suggested Citation

  • L. Gouveia & P. Martins, 1999. "The Capacitated Minimal Spanning Tree Problem: An experiment with a hop‐indexedmodel," Annals of Operations Research, Springer, vol. 86(0), pages 271-294, January.
    • Handle: RePEc:spr:annopr:v:86:y:1999:i:0:p:271-294:10.1023/a:1018911003529
    DOI: 10.1023/A:1018911003529
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1023/A:1018911003529
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1023/A:1018911003529?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

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

    Citations

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


    Cited by:

    1. Gustavo Bergantiños & Leticia Lorenzo, 2021. "Cost additive rules in minimum cost spanning tree problems with multiple sources," Annals of Operations Research, Springer, vol. 301(1), pages 5-15, June.
    2. Uchoa, Eduardo & Fukasawa, Ricardo & Lysgaard, Jens & Pessoa, Artur & Poggi de Aragão, Marcus & Andrade, Diogo, 2006. "Robust Branch-Cut-and-Price for the Capacitated Minimum Spanning Tree Problem over a Large Extended Formulation," CORAL Working Papers L-2006-08, University of Aarhus, Aarhus School of Business, Department of Business Studies.
    3. Zhixing Luo & Hu Qin & T. C. E. Cheng & Qinghua Wu & Andrew Lim, 2021. "A Branch-and-Price-and-Cut Algorithm for the Cable-Routing Problem in Solar Power Plants," INFORMS Journal on Computing, INFORMS, vol. 33(2), pages 452-476, May.
    4. Scheibe, Kevin P. & Ragsdale, Cliff T., 2009. "A model for the capacitated, hop-constrained, per-packet wireless mesh network design problem," European Journal of Operational Research, Elsevier, vol. 197(2), pages 773-784, September.

    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:spr:annopr:v:86:y:1999:i:0:p:271-294:10.1023/a:1018911003529. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.