IDEAS home Printed from https://ideas.repec.org/a/ids/ijores/v17y2013i4p509-525.html
   My bibliography  Save this article

A new greedy randomised adaptive search procedure for solving the maximum satisfiability problem

Author

Listed:
  • Abdesslem Layeb

Abstract

The maximum satisfiability problem (Max-Sat) is one of the most known variant of satisfiability problems. The objective is to find the best assignment for a set of Boolean variables that gives the maximum of verified clauses in a Boolean formula. Unfortunately, this problem was showed NP-complete if the number of variable per clause is higher than 3. In this paper, a new incomplete algorithm based on a greedy randomised adaptive search procedure (GRASP) is presented to deal with Max 3-Sat problem. The first GRASP's phase is a new greedy algorithm based on iterative application of a new version of pure literal elimination technique called weighted literal elimination. In the next stage of the GRASP algorithm, a modified version of the Walksat procedure is applied using, as initial solutions, the solutions found by the greedy procedure of the GRASP algorithm. The obtained results are very encouraging and show the feasibility and effectiveness of the proposed approach.

Suggested Citation

  • Abdesslem Layeb, 2013. "A new greedy randomised adaptive search procedure for solving the maximum satisfiability problem," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 17(4), pages 509-525.
    • Handle: RePEc:ids:ijores:v:17:y:2013:i:4:p:509-525
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=54970
    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:ijores:v:17:y:2013:i:4:p:509-525. 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=170 .

    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.