most citedStochastic Item Descent Method for Large Scale Equal Circle Packing Problem

1 citations · 2 across the 3 of their papers we have counts for

collaborators
Showing cs.AIShow 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.AI2020★ 1 cited

Combining Reinforcement Learning with Lin-Kernighan-Helsgaun Algorithm for the Traveling Salesman Problem

Jiongzhi Zheng, Kun He, Jianrong Zhou +2

We address the Traveling Salesman Problem (TSP), a famous NP-hard combinatorial optimization problem. And we propose a variable strategy reinforced approach, denoted as VSR-LKH, wh…