Abstract
Issues related to the solution of the traveling salesman problem are considered. An algorithm for constructing the traveling salesman problem with a predetermined optimal cyclic solution has been developed. The algorithm can be used to evaluate the effectiveness of methods for solving the traveling salesman problem, to determine the optimality of a feasible solution found in some way, and also to understand the structure of problems with a given cyclic optimal solution.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
