MAX-SAT Problem using Hybrid Harmony Search Algorithm

MAX-SAT Problem using Hybrid Harmony Search Algorithm

Maximum Satisfiability problem is an optimization variant of the Satisfiability problem (SAT) denoted as MAX-SAT. The aim of this problem is to find Boolean variable assignment that maximizes the number of satisfied clauses in the Boolean formula. In case the number of variables per clause is equal...

Full description

Bibliographic Details
Main Authors: Abu Doush Iyad, Quran Amal Lutfi, Al-Betar Mohammed Azmi, Awadallah Mohammed A.
Format: Article
Language:English
Published: De Gruyter 2018-10-01
Series:Journal of Intelligent Systems
Subjects:
maximum satisfiability problem
harmony search
local search
optimization
3sat problem
evolutionary algorithms
max-sat problem
metaheuristic
Online Access:https://doi.org/10.1515/jisys-2016-0129

Similar Items

Similar Items