42 citations · 55 across the 9 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
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…
math.OC2020★ 1 cited
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…