A traveling salesman problem is studied, containing a shortest Hamiltonian tour that is as long as a shortest pyramidal tour. A tour is pyramidal if it consists of a path from city 1 to n with cities in between visited in ascending order, and a path from n to 1 with cities in between visited in descending order. If the distance matrix satisfies the so-called Demidenko conditions, in which case it is called a Demidenko matrix, then there exists an optimal tour that is pyramidal. A new proof of this theorm is given for symmetric Denidenko matrices. The proof cannot be used for the nonsymmetric case. If, however, the Demidenko conditions are replaced by somewhat stronger conditions it is possible to give a similar proof for the nonsymmetric case. A method to construct Demidenko matrices is presented and, finally, several TSP heuristics are tested on the class of Demidenko matrices.
