IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v8y2004i4d10.1007_s10878-004-4835-9.html
   My bibliography  Save this article

A Novel Evolutionary Formulation of the Maximum Independent Set Problem

Author

Listed:
  • Valmir C. Barbosa

    (Universidade Federal do Rio de Janeiro, Programa de Engenharia de Sistemas e Computação)

  • Luciana C. D. Campos

    (Universidade Federal do Rio de Janeiro, Programa de Engenharia de Sistemas e Computação)

Abstract

We introduce a novel evolutionary formulation of the problem of finding a maximum independent set of a graph. The new formulation is based on the relationship that exists between a graph’s independence number and its acyclic orientations. It views such orientations as individuals and evolves them with the aid of evolutionary operators that are very heavily based on the structure of the graph and its acyclic orientations. The resulting heuristic has been tested on some of the Second DIMACS Implementation Challenge benchmark graphs, and has been found to be competitive when compared to several of the other heuristics that have also been tested on those graphs.

Suggested Citation

  • Valmir C. Barbosa & Luciana C. D. Campos, 2004. "A Novel Evolutionary Formulation of the Maximum Independent Set Problem," Journal of Combinatorial Optimization, Springer, vol. 8(4), pages 419-437, December.
    • Handle: RePEc:spr:jcomop:v:8:y:2004:i:4:d:10.1007_s10878-004-4835-9
    DOI: 10.1007/s10878-004-4835-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-004-4835-9
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-004-4835-9?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. Qinghua Wu & Jin-Kao Hao, 2013. "An adaptive multistart tabu search approach to solve the maximum clique problem," Journal of Combinatorial Optimization, Springer, vol. 26(1), pages 86-108, July.

    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:jcomop:v:8:y:2004:i:4:d:10.1007_s10878-004-4835-9. 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.