IDEAS home Printed from https://ideas.repec.org/a/ids/eujine/v1y2007i3p317-340.html
   My bibliography  Save this article

Genetic algorithms for generalised hypertree decompositions

Author

Listed:
  • Nysret Musliu
  • Werner Schafhauser

Abstract

Many practical problems in mathematics and computer science may be formulated as Constraint Satisfaction Problems (CSPs). Although CSPs are NP-hard in general, it has been proven that instances of CSPs may be solved efficiently, if they have generalised hypertree decompositions of small width. Unfortunately, finding a generalised hypertree decomposition of minimum width is an NP-hard problem. Based on a Genetic Algorithm (GA) for tree decompositions we propose two extensions searching for small-width generalised hypertree decompositions. We carry out comprehensive experiments to obtain suitable operators and parameter settings and apply each GA to numerous benchmark examples for tree and generalised hypertree decompositions. Compared to the best solutions known from literature our GAs were able to return results of equal quality for many benchmark instances and even for some benchmarks improved solutions were obtained. [Received 6 February 2007; Revised 21 May 2007; Accepted 22 May 2007]

Suggested Citation

  • Nysret Musliu & Werner Schafhauser, 2007. "Genetic algorithms for generalised hypertree decompositions," European Journal of Industrial Engineering, Inderscience Enterprises Ltd, vol. 1(3), pages 317-340.
    • Handle: RePEc:ids:eujine:v:1:y:2007:i:3:p:317-340
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=14690
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:ids:eujine:v:1:y:2007:i:3:p:317-340. 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=210 .

    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.