13 citations · 22 across the 8 of their papers we have counts for
9 papers
Combining Monte Carlo Tree Search and Heuristic Search for Weighted Vertex Coloring
Cyril Grelier, Olivier Goudet, Jin-Kao Hao
This work investigates the Monte Carlo Tree Search (MCTS) method combined with dedicated heuristics for solving the Weighted Vertex Coloring Problem. In addition to the basic MCTS…
A Partition-and-Merge Algorithm for Solving the Steiner Tree Problem in Large Graphs
Ming Sun, Xinyu Wu, Yi Zhou +2
The Steiner tree problem aims to determine a minimum edge-weighted tree that spans a given set of terminal vertices from a given graph. In the past decade, a considerable number of…
On Monte Carlo Tree Search for Weighted Vertex Coloring
Cyril Grelier, Olivier Goudet, Jin-Kao Hao
This work presents the first study of using the popular Monte Carlo Tree Search (MCTS) method combined with dedicated heuristics for solving the Weighted Vertex Coloring Problem. S…
An effective hybrid search algorithm for the multiple traveling repairman problem with profits
Jintong Ren, Jin-Kao Hao, Feng Wu +1
As an extension of the traveling repairman problem with profits, the multiple traveling repairman problem with profits consists of multiple repairmen who visit a subset of all cust…
A deep learning guided memetic framework for graph coloring problems
Olivier Goudet, Cyril Grelier, Jin-Kao Hao
Given an undirected graph with a set of vertices and a set of edges , a graph coloring problem involves finding a partition of the vertices into different independ…
A massively parallel evolutionary algorithm for the partial Latin square extension problem
Olivier Goudet, Jin-Kao Hao
The partial Latin square extension problem is to fill as many as possible empty cells of a partially filled Latin square. This problem is a useful model for a wide range of applica…
A threshold search based memetic algorithm for the disjunctively constrained knapsack problem
Zequn Wei, Jin-Kao Hao
The disjunctively constrained knapsack problem consists in packing a subset of pairwisely compatible items in a capacity-constrained knapsack such that the total profit of the sele…
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…
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…