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

Authors:
Rainer E. Burkard;Vladimir G. Deineko;René van Dal;Jack A. A. van;der Veen;Gerhard J. Woeginger
Affiliations:
-;-;-;-;-;-
Venue:
SIAM Review
Year:
1998

Citing 0
Cited 24

TSP-based curve reconstruction in polynomial time

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Traveling salesman games with the Monge property

Discrete Applied Mathematics
Conic Characterization of Monge Matrices

Cybernetics and Systems Analysis
On the euclidean TSP with a permuted Van der Veen matrix

Information Processing Letters
The maximum traveling salesman problem on van der Veen matrices

Discrete Applied Mathematics
Two-Machine Stochastic Flow Shops With Blocking and the Traveling Salesman Problem

Journal of Scheduling
Four point conditions and exponential neighborhoods for symmetric TSP

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
The Traveling Salesman Problem in Circulant Weighted Graphs With Two Stripes

Electronic Notes in Theoretical Computer Science (ENTCS)
The Number of Flips Required to Obtain Non-crossing Convex Cycles

Computational Geometry and Graph Theory
Scheduling of Container Storage and Retrieval

Operations Research
An approximation algorithm for a bottleneck traveling salesman problem

Journal of Discrete Algorithms
Fast minimum-weight double-tree shortcutting for metric TSP: Is the best one good enough?

Journal of Experimental Algorithmics (JEA)
Communications: The maximum traveling salesman problem on van der Veen matrices

Discrete Applied Mathematics
Pyramidal tours and multiple objectives

Journal of Global Optimization
On the asymptotic behavior of subtour-patching heuristics in solving the TSP on permuted Monge matrices

Journal of Heuristics
A parallel multi-start search algorithm for dynamic traveling salesman problem

SEA'11 Proceedings of the 10th international conference on Experimental algorithms
Wisdom of artificial crowds algorithm for solving NP-hard problems

International Journal of Bio-Inspired Computation
Three value TSP and linkages with the three value linear spanning 2-forests

Discrete Applied Mathematics
Using well-solvable quadratic assignment problems for VLSI interconnect applications

Discrete Applied Mathematics
Using grammars to generate very large scale neighborhoods for the traveling salesman problem and other sequencing problems

IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
One-Sided monge TSP is NP-Hard

ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part III
A new asymmetric pyramidally solvable class of the traveling salesman problem

Operations Research Letters
A Hybrid Genetic Algorithm for the Bottleneck Traveling Salesman Problem

ACM Transactions on Embedded Computing Systems (TECS) - Special Issue on Modeling and Verification of Discrete Event Systems
Solution attractor of local search in travelling salesman problem: concept, construction and application

International Journal of Metaheuristics

Quantified Score

Hi-index	0.00

Visualization

Abstract

The traveling salesman problem (TSP) belongs to the most basic, most important, and most investigated problems in combinatorial optimization. Although it is an ${\cal NP}$-hard problem, many of its special cases can be solved efficiently in polynomial time. We survey these special cases with emphasis on the results that have been obtained during the decade 1985--1995. This survey complements an earlier survey from 1985 compiled by Gilmore, Lawler, and Shmoys [The Traveling Salesman Problem---A Guided Tour of Combinatorial Optimization, Wiley, Chichester, pp. 87--143].