Funder
National Natural Science Foundation of China
Reference67 articles.
1. Machine learning for combinatorial optimization: A methodological tour d’horizon;Bengio;European J. Oper. Res.,2021
2. Reinforcement learning with multiple relational attention for solving vehicle routing problems;Xu;IEEE Trans. Cybern.,2022
3. D. Sanches, D. Whitley, R. Tinós, Improving an exact solver for the traveling salesman problem using partition crossover, in: Proceedings of the Genetic and Evolutionary Computation Conference, 2017, pp. 337–344.
4. An analysis of several heuristics for the traveling salesman problem;Rosenkrantz;SIAM J. Comput.,1977
5. An extension of the Lin-Kernighan-Helsgaun TSP solver for constrained traveling salesman and vehicle routing problems;Helsgaun,2017
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献