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
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

06/26/2018

Finding a Maximum-Weight Convex Set in a Chordal Graph

We consider a natural combinatorial optimization problem on chordal grap...
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...
07/11/2012

On finding minimal w-cutset

The complexity of a reasoning task over a graphical model is tied to the...
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...
08/16/2021

An Efficient Parallel Algorithm for finding Bridges in a Dense Graph

This paper presents a simple and efficient approach for finding the brid...
06/12/2020

SMS in PACE 2020

We describe SMS, our submission to the exact treedepth track of PACE 202...
02/03/2022

A New Approach to Determine the Minimal Polynomials of Binary Modified de Bruijn Sequences

A binary modified de Bruijn sequence is an infinite and periodic binary ...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.