A refined branching algorithm for the maximum satisfiability problem
From MaRDI portal
Publication:2118385
DOI10.1007/s00453-022-00938-8OpenAlexW4210922699MaRDI QIDQ2118385
Yongjie Yang, Wenjun Li, Jianxin Wang, Chao Xu, Jian'er Chen
Publication date: 22 March 2022
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-022-00938-8
Related Items (2)
Generalization of the subset sum problem and cubic forms ⋮ Using the method of conditional expectations to supply an improved starting point for CCLS
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A simplified NP-complete MAXSAT problem
- The configurable SAT solver challenge (CSSC)
- CCEHC: an efficient local search algorithm for weighted partial maximum satisfiability
- Dealing with 4-variables by resolution: an improved MaxSAT algorithm
- Exact exponential algorithms.
- Improved upper bounds for vertex cover
- Some simplified NP-complete graph problems
- Approximating satisfiable satisfiability problems
- Improved exact algorithms for MAX-SAT
- A new upper bound for \(( n , 3)\)-MAX-SAT
- Iterative and core-guided maxsat solving: a survey and assessment
- Scoring Functions Based on Second Level Score for k-SAT with Long Clauses
- New Bounds for MAX-SAT by Clause Learning
- Kernelization: New Upper and Lower Bound Techniques
- New $\frac{3}{4}$-Approximation Algorithms for the Maximum Satisfiability Problem
- New Upper Bounds for Maximum Satisfiability
- A New Algorithm for Parameterized MAX-SAT
- Greedy Algorithms for the Maximum Satisfiability Problem: Simple Algorithms and Inapproximability Bounds
- The complexity of satisfiability problems
- On the complexity of \(k\)-SAT
This page was built for publication: A refined branching algorithm for the maximum satisfiability problem
