3 citations · 9 across the 11 of their papers we have counts for
11 papers
An Efficient Solution Space Exploring and Descent Method for Packing Equal Spheres in a Sphere
Jianrong Zhou, Shuo Ren, Kun He +2
The problem of packing equal spheres in a spherical container is a classic global optimization problem, which has attracted enormous studies in academia and found various applicati…
Pointerformer: Deep Reinforced Multi-Pointer Transformer for the Traveling Salesman Problem
Yan Jin, Yuandong Ding, Xuanhao Pan +5
Traveling Salesman Problem (TSP), as a classic routing optimization problem originally arising in the domain of transportation and logistics, has become a critical task in broader…
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…
Reinforced Lin-Kernighan-Helsgaun Algorithms for the Traveling Salesman Problems
Jiongzhi Zheng, Kun He, Jianrong Zhou +2
TSP is a classical NP-hard combinatorial optimization problem with many practical variants. LKH is one of the state-of-the-art local search algorithms for the TSP. LKH-3 is a power…
BandMaxSAT: A Local Search MaxSAT Solver with Multi-armed Bandit
Jiongzhi Zheng, Kun He, Jianrong Zhou +3
We address Partial MaxSAT (PMS) and Weighted PMS (WPMS), two practical generalizations of the MaxSAT problem, and propose a local search algorithm for these problems, called BandMa…
Effective reinforcement learning based local search for the maximum k-plex problem
Yan Jin, John H. Drake, Una Benlic +1
The maximum k-plex problem is a computationally complex problem, which emerged from graph-theoretic social network studies. This paper presents an effective hybrid local search for…