Document is current
Any future updates will be listed below
-
Authors
-
Funding
Funding for this research was provided by:
the Ningbo Philosophy and Social Science Research Base (JD6-025)
the Scientific Research Start-up Fund of Ningbo University of Technology (No. 2023KQ041)
- License Information
-
More Information
Article History
Received: 7 May 2024
Accepted: 1 December 2024
First Online: 3 January 2025
Declarations
:
: We declare that we have no financial and personal relationships with other people or organizations that can inappropriately influence our work, there is no professional or other personal interest of any nature or kind in any product, service and/or company that could be construed as influencing the position presented in, or the review of, the manuscript entitled, “Graph attention, learning 2-opt algorithm for the traveling salesman problem”.
