Travelling salesman paths on Demidenko matrices

Eranda Dragoti-Cela*, Vladimir Deineko, Gerhard Woeginger

*Corresponding author for this work

Research output: Working paperDiscussion paper

Abstract

In the path version of the Travelling Salesman Problem (Path-TSP), a salesman islooking for the shortest Hamiltonian path through a set ofncities. The salesman hasto start his journey at a given citys, visit every city exactly once, and finally end histrip at another given cityt.In this paper we identify a new polynomially solvable case of the Path-TSP wherethe distance matrix of the cities is a so-called Demidenko matrix. We identify a numberof crucial combinatorial properties of the optimal solution, and we design a dynamicprogram with time complexityO(n6)
Original languageEnglish
Number of pages18
Publication statusPublished - 1 Oct 2020

ASJC Scopus subject areas

  • Mathematics(all)

Fields of Expertise

  • Information, Communication & Computing

Treatment code (Nähere Zuordnung)

  • Basic - Fundamental (Grundlagenforschung)

Fingerprint

Dive into the research topics of 'Travelling salesman paths on Demidenko matrices'. Together they form a unique fingerprint.

Cite this