Dynamic Initial Weight Assignment for MaxSAT
The Maximum Satisfiability (Maximum Satisfiability (MaxSAT)) approach is the choice, and perhaps the only one, to deal with most real-world problems as most of them are unsatisfiable. Thus, the search for a complete and consistent solution to a real-world problem is impractical due to computational...
Main Authors: | Abdelraouf Ishtaiwi, Qasem Abu Al-Haija |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2021-03-01
|
Series: | Algorithms |
Subjects: | |
Online Access: | https://www.mdpi.com/1999-4893/14/4/115 |
Similar Items
-
The Impact of Implied Constraints on MaxSAT B2B Instances
by: Miquel Bofill, et al.
Published: (2022-08-01) -
Initial Solution Generation and Diversified Variable Picking in Local Search for (Weighted) Partial MaxSAT
by: Zaijun Zhang, et al.
Published: (2022-12-01) -
MAX-SAT Problem using Hybrid Harmony Search Algorithm
by: Abu Doush Iyad, et al.
Published: (2018-10-01) -
Clausal Forms in MaxSAT and MinSAT
by: Chu Min Li, et al.
Published: (2022-11-01) -
A Stochastic Local Search Algorithm for the Partial Max-SAT Problem Based on Adaptive Tuning and Variable Depth Neighborhood Search
by: Haifa Hamad Alkasem, et al.
Published: (2021-01-01)