• Home
  • Search
  • Universal Conditions for Algebraic Traveling Salesman Problems to be Efficiently Solvable
  • Cite Icon13
  • https://doi.org/10.1007/978-3-642-48417-9_41Copy DOI Icon

Universal Conditions for Algebraic Traveling Salesman Problems to be Efficiently Solvable

  • Jan 1, 1992
  • R. E. Burkard +1 more
Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

In recent years special cases of the Traveling Salesman Problem (TSP) solvable by polynomially bounded algorithms found considerable interest. Usually one considers TSPs with a sum as objective function, i.e. the cost of a tour is defined as a sum of all costs of single arcs of the tour. Another possibility is the Bottleneck TSP where the maximum cost of a single arc of the tour is minimized. A closer look shows that the special cases of TSPs fall into several classes. On one hand there are problems for which the sum problem but not the bottleneck problem is known to be efficiently solvable, e.g. if the nonsymmetric Demidenko conditions are fulfilled. On the other hand there are other special cases where the Bottleneck TSP can be solved efficiently, but not the corresponding sum case, e.g. if the cost matrix is a symmetric circulant or if it is graded. Finally, there are conditions which imply by their algebraic and combinatorial structure that both the sum and the bottleneck problem are solvable.

Similar Papers
  • Research Article
  • Citations45

The Traveling Salesman Problem: Low-Dimensionality Implies a Polynomial Time Approximation Scheme

  • Jan 01, 2016
  • SIAM Journal on Computing
  • Yair Bartal +2
  • Research Article
  • Citations17

An Algorithm for the Bottleneck Traveling Salesman Problem

  • Apr 01, 1984
  • Operations Research
  • Giorgio Carpaneto +2
  • Research Article
  • Citations13

New Formulations for the Orienteering Problem

  • Jan 01, 2016
  • Procedia Economics and Finance
  • Imdat Kara +2
  • Research Article
  • Citations8

Hybrid Algorithm for Colored Bottleneck Traveling Salesman Problem

  • Nov 12, 2018
  • Journal of Computer Research and Development
  • Xianguang Dong +2
  • PDF
  • Research Article
  • Citations3

Equivalent cyclic polygon of a euclidean travelling salesman problem tour and modified formulation

  • Dec 02, 2021
  • Central European Journal of Operations Research
  • A Herraiz +2
  • Research Article
  • Citations11

Shorter tours and longer detours: uniform covers and a bit beyond

  • Aug 21, 2019
  • Mathematical Programming
  • Arash Haddadan +2
  • Book Chapter
  • Citations5

Approximation Algorithms for Multi-criteria Traveling Salesman Problems

  • Jan 01, 2007
  • Bodo Manthey +1
  • Conference Article
  • Citations32

Cost effective mobile agent planning for distributed information retrieval

  • Apr 16, 2001
  • Jin-Wook Baek +3
  • Research Article
  • Citations410

Routing for Relief Efforts

  • May 01, 2008
  • Transportation Science
  • Ann Melissa Campbell +2
  • Research Article
  • Citations35

A Critical Review of Multi-hole Drilling Path Optimization

  • Jan 22, 2018
  • Archives of Computational Methods in Engineering
  • Reginald Dewil +3
  • Research Article
  • Citations169

Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey

  • Jan 01, 1998
  • SIAM Review
  • Rainer E Burkard +4
  • Research Article
  • Citations37

The dynamic programming method in the generalized traveling salesman problem

  • Jan 01, 1997
  • Mathematical and Computer Modelling
  • A.G Chentsov +1
  • Research Article
  • Citations100

A new mathematical programming formulation for the Single-Picker Routing Problem

  • Feb 17, 2016
  • European Journal of Operational Research
  • André Scholz +3
  • Research Article
  • Citations1

A pattern recognition lexi search approach to generalized time-dependent travelling salesman problem

  • Apr 28, 2012
  • OPSEARCH
  • U Balakrishna +1
  • Research Article
  • Citations4

A three-phase algorithm for the pollution traveling Salesman problem

  • Apr 20, 2024
  • Heliyon
  • Karen García-Vasquez +2
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.