3 citations · 9 across the 11 of their papers we have counts for
11 papers
Solution-Hashing Search Based on Layout-Graph Transformation for Unequal Circle Packing
Jianrong Zhou, Jiyao He, Kun He
The problem of packing unequal circles into a circular container stands as a classic and challenging optimization problem in computational geometry. This study introduces a suite o…
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…
Geometric Batch Optimization for the Packing Equal Circles in a Circle Problem on Large Scale
Jianrong Zhou, Kun He, Jiongzhi Zheng +1
The problem of packing equal circles in a circle is a classic and famous packing problem, which is well-studied in academia and has a variety of applications in industry. This prob…
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…
Effective Variable Depth Local Search for the Budgeted Maximum Coverage Problem
Jianrong Zhou, Jiongzhi Zheng, Kun He
We address the Budgeted Maximum Coverage Problem (BMCP), which is a natural and more practical extension of the standard 0-1 knapsack problem and the set cover problem. Given m ele…
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…
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…
Farsighted Probabilistic Sampling: A General Strategy for Boosting Local Search MaxSAT Solvers
Jiongzhi Zheng, Kun He, Jianrong Zhou
Local search has been demonstrated as an efficient approach for two practical generalizations of the MaxSAT problem, namely Partial MaxSAT (PMS) and Weighted PMS (WPMS). In this wo…
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…
Stochastic Item Descent Method for Large Scale Equal Circle Packing Problem
Kun He, Min Zhang, Jianrong Zhou +2
Stochastic gradient descent (SGD) is a powerful method for large-scale optimization problems in the area of machine learning, especially for a finite-sum formulation with numerous…