Reinforced Lin–Kernighan–Helsgaun algorithms for the traveling salesman problems

J Zheng, K He, J Zhou, Y Jin, CM Li - Knowledge-Based Systems, 2023 - Elsevier
Abstract The Traveling Salesman Problem (TSP) is a classical NP-hard combinatorial
optimization problem with many practical variants. The Lin–Kernighan–Helsgaun (LKH) …
被引用次数：23 相关文章

Reinforced Lin–Kernighan–Helsgaun algorithms for the traveling salesman problems

J Zheng, K He, J Zhou, Y Jin, CM Li - Knowledge-Based Systems, 2022 - hal.science
The Traveling Salesman Problem (TSP) is a classical NP-hard combinatorial optimization
problem with many practical variants. The Lin-Kernighan-Helsgaun (LKH) algorithm is one …

Reinforced Lin-Kernighan-Helsgaun Algorithms for the Traveling Salesman Problems

J Zheng, K He, J Zhou, Y Jin, CM Li - arXiv e-prints, 2022 - ui.adsabs.harvard.edu
TSP is a classical NP-hard combinatorial optimization problem with many practical variants.
LKH is one of the state-of-the-art local search algorithms for the TSP. LKH-3 is a powerful …

Reinforced Lin-Kernighan-Helsgaun Algorithms for the Traveling Salesman Problems

J Zheng, K He, J Zhou, Y Jin, CM Li - arXiv preprint arXiv:2207.03876, 2022 - arxiv.org
TSP is a classical NP-hard combinatorial optimization problem with many practical variants.
LKH is one of the state-of-the-art local search algorithms for the TSP. LKH-3 is a powerful …

Reinforced Lin–Kernighan–Helsgaun algorithms for the traveling salesman problems

J Zheng, K He, J Zhou, Y Jin… - Knowledge-Based …, 2023 - u-picardie.hal.science
The Traveling Salesman Problem (TSP) is a classical NP-hard combinatorial optimization
problem with many practical variants. The Lin–Kernighan–Helsgaun (LKH) algorithm is one …

Reinforced Lin–Kernighan–Helsgaun algorithms for the traveling salesman problems

J Zheng, K He, J Zhou, Y Jin, CM Li - 2023 - dl.acm.org
Abstract The Traveling Salesman Problem (TSP) is a classical NP-hard combinatorial
optimization problem with many practical variants. The Lin–Kernighan–Helsgaun (LKH) …