IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v39y1989i3p325-331.html
   My bibliography  Save this article

A Lagrangean approach to the degree-constrained minimum spanning tree problem

Author

Listed:
  • Volgenant, A.

Abstract

No abstract is available for this item.

Suggested Citation

  • Volgenant, A., 1989. "A Lagrangean approach to the degree-constrained minimum spanning tree problem," European Journal of Operational Research, Elsevier, vol. 39(3), pages 325-331, April.
    • Handle: RePEc:eee:ejores:v:39:y:1989:i:3:p:325-331
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0377-2217(89)90169-0
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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. Luis Bicalho & Alexandre Cunha & Abilio Lucena, 2016. "Branch-and-cut-and-price algorithms for the Degree Constrained Minimum Spanning Tree Problem," Computational Optimization and Applications, Springer, vol. 63(3), pages 755-792, April.
    2. Fernandes, Lucinda Matos & Gouveia, Luis, 1998. "Minimal spanning trees with a constraint on the number of leaves," European Journal of Operational Research, Elsevier, vol. 104(1), pages 250-261, January.
    3. Rakesh Kawatra, 2022. "Design of capacitated degree constrained min-sum arborescence," OPSEARCH, Springer;Operational Research Society of India, vol. 59(3), pages 1038-1054, September.
    4. Kawatra, Rakesh & Bricker, Dennis, 2004. "Design of a degree-constrained minimal spanning tree with unreliable links and node outage costs," European Journal of Operational Research, Elsevier, vol. 156(1), pages 73-82, July.
    5. Kawatra, Rakesh, 2002. "A multiperiod degree constrained minimal spanning tree problem," European Journal of Operational Research, Elsevier, vol. 143(1), pages 53-63, November.
    6. Marcel Turkensteen & Dmitry Malyshev & Boris Goldengorin & Panos M. Pardalos, 2017. "The reduction of computation times of upper and lower tolerances for selected combinatorial optimization problems," Journal of Global Optimization, Springer, vol. 68(3), pages 601-622, July.
    7. Steven Chamberland & Brunilde Sansò & Odile Marcotte, 2000. "Topological Design of Two-Level Telecommunication Networks with Modular Switches," Operations Research, INFORMS, vol. 48(5), pages 745-760, October.

    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:eee:ejores:v:39:y:1989:i:3:p:325-331. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.