An improved algorithm for the \((n, 3)\)-MaxSAT problem: asking branchings to satisfy the clauses
From MaRDI portal
Publication:2051907
DOI10.1007/s10878-019-00421-1zbMath1481.90280MaRDI QIDQ2051907
Yongjie Yang, Chao Xu, Jianxin Wang, Wenjun Li
Publication date: 25 November 2021
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-019-00421-1
Uses Software