A Grid-Based Two-Stage Parallel Matching Framework for Bi-Objective Euclidean Traveling Salesman Problem

F Lin, HP Hsieh - ACM Transactions on Spatial Algorithms and Systems, 2022 - dl.acm.org
Traveling salesman problem (TSP) is one of the most studied combinatorial optimization
problems; several exact, heuristic or even learning-based strategies have been proposed to …
相关文章

A Grid-Based Two-Stage Parallel Matching Framework for Bi-Objective Euclidean Traveling Salesman Problem

F Lin, HP Hsieh - ACM Transactions on Spatial …, 2022 - researchoutput.ncku.edu.tw
Traveling salesman problem (TSP) is one of the most studied combinatorial optimization
problems; several exact, heuristic or even learning-based strategies have been proposed to …