2 citations · 6 across the 6 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
cs.AI2022
Incorporating Multi-armed Bandit with Local Search for MaxSAT
Jiongzhi Zheng, Kun He, Jianrong Zhou +3
Partial MaxSAT (PMS) and Weighted PMS (WPMS) are two practical generalizations of the MaxSAT problem. In this paper, we propose a local search algorithm for these problems, called…
cs.DS2022★ 2 cited
A Strengthened Branch and Bound Algorithm for the Maximum Common (Connected) Subgraph Problem
Jianrong Zhou, Kun He, Jiongzhi Zheng +2
We propose a new and strengthened Branch-and-Bound (BnB) algorithm for the maximum common (connected) induced subgraph problem based on two new operators, Long-Short Memory (LSM) a…