IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v42y1994i5p860-878.html
   My bibliography  Save this article

A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set

Author

Listed:
  • Thomas A. Feo

    (The University of Texas at Austin, Austin, Texas)

  • Mauricio G. C. Resende

    (AT&T Bell Laboratories, Murray Hill, New Jersey)

  • Stuart H. Smith

    (Purdue University, West Lafayette, Indiana)

Abstract

An efficient randomized heuristic for a maximum independent set is presented. The procedure is tested on randomly generated graphs having from 400 to 3,500 vertices and edge probabilities from 0.2 to 0.9. The heuristic can be implemented trivially in parallel and is tested on an MIMD computer with 1, 2, 4 and 8 processors. Computational results indicate that the heuristic frequently finds the optimal or expected optimal solution in a fraction of the time required by implementations of simulated annealing, tabu search, and an exact partial enumeration method.

Suggested Citation

  • Thomas A. Feo & Mauricio G. C. Resende & Stuart H. Smith, 1994. "A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set," Operations Research, INFORMS, vol. 42(5), pages 860-878, October.
    • Handle: RePEc:inm:oropre:v:42:y:1994:i:5:p:860-878
    DOI: 10.1287/opre.42.5.860
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.42.5.860
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.42.5.860?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
    ---><---

    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:inm:oropre:v:42:y:1994:i:5:p:860-878. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.