CCEHC: an efficient local search algorithm for weighted partial maximum satisfiability
From MaRDI portal
Publication:502391
DOI10.1016/j.artint.2016.11.001zbMath1402.68163OpenAlexW2549191282MaRDI QIDQ502391
Chuan Luo, Shaowei Cai, Wenxuan Huang, Kaile Su
Publication date: 5 January 2017
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2016.11.001
Related Items (10)
An effective iterated two-stage heuristic algorithm for the multiple traveling salesmen problem ⋮ An efficient local search algorithm for solving maximum edge weight clique problem in large graphs ⋮ An Experimental Evaluation of Fast Approximation Algorithms for the Maximum Satisfiability Problem ⋮ CHAMP: a multipass algorithm for Max Sat based on saver variables ⋮ Old techniques in new ways: clause weighting, unit propagation and hybridization for maximum satisfiability ⋮ An improved algorithm for the \((n, 3)\)-MaxSAT problem: asking branchings to satisfy the clauses ⋮ Cooperative parallel SAT local search with path relinking ⋮ CCEHC ⋮ Open-WBO-Inc: Approximation Strategies for Incomplete Weighted MaxSAT ⋮ A refined branching algorithm for the maximum satisfiability problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- New local search methods for partial MaxSAT
- SAT-based MaxSAT algorithms
- Local search for Boolean satisfiability with configuration checking and subscore
- Mendelian error detection in complex pedigrees using weighted constraint satisfaction tech\-niques
- An electromagnetism metaheuristic for the unicost set covering problem
- Many hard examples in exact phase transitions
- Computational protein design as an optimization problem
- Scoring Functions Based on Second Level Score for k-SAT with Long Clauses
- CCLS: An Efficient Local Search Algorithm for Weighted Maximum Satisfiability
- Solving Satisfiability with Less Searching
- Neighbourhood Clause Weight Redistribution in Local Search for SAT
- Exploiting Cycle Structures in Max-SAT
- Relaxed Survey Propagation for The Weighted Maximum Satisfiability Problem
- ParamILS: An Automatic Algorithm Configuration Framework
- GRASP: a search algorithm for propositional satisfiability
- NuMVC: An Efficient Local Search Algorithm for Minimum Vertex Cover
- Beitrag zur Theorie des Ferromagnetismus
- Parallel AES Encryption Engines for Many-Core Processor Arrays
- Concurrent Structure-Independent Fault Detection Schemes for the Advanced Encryption Standard
- A Computing Procedure for Quantification Theory
- A machine program for theorem-proving
This page was built for publication: CCEHC: an efficient local search algorithm for weighted partial maximum satisfiability
