A new asymmetric pyramidally solvable class of the traveling salesman problem

A new asymmetric pyramidally solvable class of the traveling salesman problem

0.00 Avg rating0 Votes
Article ID: iaor20073136
Country: Netherlands
Volume: 34
Issue: 6
Start Page Number: 613
End Page Number: 620
Publication Date: Nov 2006
Journal: Operations Research Letters
Authors:
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.

Reviews

Required fields are marked *. Your email address will not be published.