The 1-1 algorithm for Travelling Salesman Problem

04/21/2021
by   Heping Jiang, et al.
0

The Travelling Salesman Problem (TSP), finding a minimal weighted Hamilton cycle in a graph, is a typical problem in operation research and combinatorial optimization. In this paper, based on some novel properties on Hamilton graphs, we present a precise algorithm for finding a minimal weighted Hamilton cycle in a non-metric and symmetric graph with time complexity of O(|E(G)|^3) , where |E(G)| is the size of graph G.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset

Sign in with Google

×

Use your Google Account to sign in to DeepAI

×

Consider DeepAI Pro