research
∙
08/09/2023
A Hierarchical Destroy and Repair Approach for Solving Very Large-Scale Travelling Salesman Problem
For prohibitively large-scale Travelling Salesman Problems (TSPs), exist...
share
research
∙
02/24/2022
A Partition-and-Merge Algorithm for Solving the Steiner Tree Problem in Large Graphs
The Steiner tree problem, which asks for a minimum weighted tree spannin...
research
∙
12/03/2021
Feature Importance-aware Graph Attention Network and Dueling Double Deep Q-Network Combined Approach for Critical Node Detection Problems
Detecting critical nodes in sparse networks is important in a variety of...
research
∙
12/19/2020
Generalize a Small Pre-trained Model to Arbitrarily Large TSP Instances
For the traveling salesman problem (TSP), the existing supervised learni...
research
∙
09/12/2019
Variable Population Memetic Search: A Case Study on the Critical Node Problem
Population-based memetic algorithms have been successfully applied to so...
research
∙
02/06/2014
