A new asymmetric pyramidally solvable class of the traveling salesman problem

Authors:
Mohammed Fazle Baki
Affiliations:
Odette School of Business, University of Windsor, Windsor, Ont., Canada, N9B 3P4
Venue:
Operations Research Letters
Year:
2006

Citing 11
Cited 1

Special cases of the traveling salesman problem

Applied Mathematics and Computation
A New Class of Pyramidally Solvable Symmetric Traveling Salesman Problems

SIAM Journal on Discrete Mathematics
Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey

SIAM Review
Pyramidal tours with step-backs and the asymmetric traveling salesman problem

Discrete Applied Mathematics
Gilmore-gomory type traveling salesman problems

Computers and Operations Research - Special issue on the traveling salesman problem
Pyramidal traveling salesman problem

Computers and Operations Research - Special issue on the traveling salesman problem
The maximum travelling salesman problem on symmetric Demidenko matrices

Proceedings of the 5th Twente workshop on on Graphs and combinatorial optimization
An asymmetric analogue of van der Veen conditions and the traveling salesman problem

Discrete Applied Mathematics
New polynomially solvable classes and a new heuristic for the traveling salesman problem and its generalization

Discrete Applied Mathematics
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
The maximum traveling salesman problem on van der Veen matrices

Discrete Applied Mathematics

Pyramidal tours and multiple objectives

Journal of Global Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a new method of identifying a class of asymmetric matrices for which an optimal traveling salesman tour exists that is pyramidal. The new class generalizes two previously known classes of matrices and includes some new matrices as well.