IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v53y2002i5d10.1057_palgrave.jors.2601246.html
   My bibliography  Save this article

A simple enhancement of the Esau–Williams heuristic for the capacitated minimum spanning tree problem

Author

Listed:
  • G Bruno

    (Università di Napoli)

  • G Laporte

    (GERAD and École des Hautes Études Commerciales)

Abstract

The Esau–Williams algorithm is one of the best known heuristics for the capacitated minimum spanning tree problem. This paper describes a simple enhancement of this heuristic. On benchmark test problems, the modified method does not result in much larger computation times and almost always produces lower solution values than does the Esau–Williams algorithm. The improvements are often significant.

Suggested Citation

  • G Bruno & G Laporte, 2002. "A simple enhancement of the Esau–Williams heuristic for the capacitated minimum spanning tree problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 53(5), pages 583-586, May.
    • Handle: RePEc:pal:jorsoc:v:53:y:2002:i:5:d:10.1057_palgrave.jors.2601246
    DOI: 10.1057/palgrave.jors.2601246
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/palgrave.jors.2601246
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/palgrave.jors.2601246?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. M. Kritikos & G. Ioannou, 2017. "A greedy heuristic for the capacitated minimum spanning tree problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(10), pages 1223-1235, October.
    2. T Öncan & İ K Altınel, 2009. "Parametric enhancements of the Esau–Williams heuristic for the capacitated minimum spanning tree problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(2), pages 259-267, February.
    3. Gust, Gunther & Schlüter, Alexander & Feuerriegel, Stefan & Úbeda, Ignacio & Lee, Jonathan T. & Neumann, Dirk, 2024. "Designing electricity distribution networks: The impact of demand coincidence," European Journal of Operational Research, Elsevier, vol. 315(1), pages 271-288.

    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:pal:jorsoc:v:53:y:2002:i:5:d:10.1057_palgrave.jors.2601246. 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.palgrave-journals.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.