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

page 1

page 2

page 3

page 4

research
06/26/2018

Finding a Maximum-Weight Convex Set in a Chordal Graph

We consider a natural combinatorial optimization problem on chordal grap...
research
10/09/2018

Cycle Intersection Graphs and Minimum Decycling Sets of Even Graphs

We introduce the cycle intersection graph of a graph, an adaptation of t...
research
07/11/2012

On finding minimal w-cutset

The complexity of a reasoning task over a graphical model is tied to the...
research
11/29/2021

A fast algorithm on average for solving the Hamilton Cycle problem

We present CertifyHAM, an algorithm which takes as input a graph G and e...
research
12/15/2020

Efficient PTAS for the Maximum Traveling Salesman Problem in a Metric Space of Fixed Doubling Dimension

The maximum traveling salesman problem (Max TSP) is one of the intensive...
research
06/12/2020

SMS in PACE 2020

We describe SMS, our submission to the exact treedepth track of PACE 202...
research
12/13/2021

Factorization and pseudofactorization of weighted graphs

For unweighted graphs, finding isometric embeddings is closely related t...

Please sign up or login with your details

Forgot password? Click here to reset