IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v90y1999i0p185-20210.1023-a1018908614375.html
   My bibliography  Save this article

Parallel local search for Steiner trees in graphs

Author

Listed:
  • M.G.A. Verhoeven
  • M.E.M. Severens

Abstract

This paper discusses sequential and parallel local search for the Steiner tree problem ingraphs. We introduce novel neighborhoods whose computational time and space complexityis smaller than those known in the literature. We present computational results for benchmarkinstances from [3] and instances derived from real‐world traveling salesman problem instances,which contain up to 18,512 vertices and 325,093 edges. These results show that good‐qualitysolutions can be obtained in moderate running times. Furthermore, we present a parallellocal search algorithm based on multiple‐step parallelism and an optimal polynomial‐timecombination function. Computational results show that good speed‐ups can be obtainedwithout loss in quality of final solutions. Copyright Kluwer Academic Publishers 1999

Suggested Citation

  • M.G.A. Verhoeven & M.E.M. Severens, 1999. "Parallel local search for Steiner trees in graphs," Annals of Operations Research, Springer, vol. 90(0), pages 185-202, January.
    • Handle: RePEc:spr:annopr:v:90:y:1999:i:0:p:185-202:10.1023/a:1018908614375
    DOI: 10.1023/A:1018908614375
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1023/A:1018908614375
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1023/A:1018908614375?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. Alejandro Arbelaez & Deepak Mehta & Barry O’Sullivan & Luis Quesada, 2018. "A constraint-based parallel local search for the edge-disjoint rooted distance-constrained minimum spanning tree problem," Journal of Heuristics, Springer, vol. 24(3), pages 359-394, June.

    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:90:y:1999:i:0:p:185-202:10.1023/a:1018908614375. 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.