13 citations · 22 across the 8 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
cs.AI2020★ 2 cited
Probability Learning based Tabu Search for the Budgeted Maximum Coverage Problem
Liwen Li, Zequn Wei, Jin-Kao Hao +1
Knapsack problems are classic models that can formulate a wide range of applications. In this work, we deal with the Budgeted Maximum Coverage Problem (BMCP), which is a generalize…
cs.AI2020★ 3 cited
Solving the Clustered Traveling Salesman Problem via TSP methods
Yongliang Lu, Jin-Kao Hao, Qinghua Wu
The Clustered Traveling Salesman Problem (CTSP) is a variant of the popular Traveling Salesman Problem (TSP) arising from a number of real-life applications. In this work, we explo…