A refined branching algorithm for the maximum satisfiability problem
type: Item
instance of: scholarly article
title: A refined branching algorithm for the maximum satisfiability problem
author: Wen-Jun Li
author: Chao Xu
author: Yongjie Yang
author: Jianxin Wang
author: Jianer Chen
published in: Algorithmica
publication date: 2022-03-22T00:00:00Z
Mathematics Subject Classification ID: 68Wxx
Mathematics Subject Classification ID: 05Cxx
zbMATH DE Number: 7495631
zbMATH Keywords: maximum satisfiability
zbMATH Keywords: branching algorithms
zbMATH Keywords: exact algorithms
describes a project that uses: CCEHC
MaRDI profile type: Publication
full work available at URL: s00453-022-00938-8
OpenAlex ID: W4210922699
cites work: Q4511230
cites work: Q5503674
cites work: A New Algorithm for Parameterized MAX-SAT
cites work: A new upper bound for \(( n , 3)\)-MAX-SAT
cites work: Kernelization: New Upper and Lower Bound Techniques
cites work: Scoring functions based on second level score for \(k\)-SAT with long clauses
cites work: Improved exact algorithms for MAX-SAT
cites work: Improved upper bounds for vertex cover
cites work: Dealing with 4-variables by resolution: an improved MaxSAT algorithm
cites work: Exact exponential algorithms.
cites work: Q4198056
cites work: Some simplified NP-complete graph problems
cites work: New $\frac{3}{4}$-Approximation Algorithms for the Maximum Satisfiability Problem
cites work: The configurable SAT solver challenge (CSSC)
cites work: On the complexity of \(k\)-SAT
cites work: New Bounds for MAX-SAT by Clause Learning
cites work: Q3624095
cites work: CCEHC: an efficient local search algorithm for weighted partial maximum satisfiability
cites work: Q5363786
cites work: Q3090774
cites work: Iterative and core-guided maxsat solving: a survey and assessment
cites work: Q4938646
cites work: New Upper Bounds for Maximum Satisfiability
cites work: Greedy Algorithms for the Maximum Satisfiability Problem: Simple Algorithms and Inapproximability Bounds
cites work: A simplified NP-complete MAXSAT problem
cites work: The complexity of satisfiability problems
cites work: Approximating satisfiable satisfiability problems
DOI: 10.1007/S00453-022-00938-8
description: scientific article; zbMATH DE number 7495631