"An improved algorithm for the (n, 3)-MaxSAT problem: asking branchings to ..."

Chao Xu et al. (2021)

> Home

Details and statistics

DOI: 10.1007/S10878-019-00421-1

access: closed

type: Journal Article

metadata version: 2021-12-15

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jco/XuLWY21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jco/XuLWY21
Chao Xu, Wenjun Li, Jianxin Wang, Yongjie Yang:
An improved algorithm for the (n, 3)-MaxSAT problem: asking branchings to satisfy the clauses. J. Comb. Optim. 42(3): 524-542 (2021)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.