Abstract
This paper discusses several classes of restricted traveling salesman tours and polynomial time algorithms to find a shortest tour in those classes. Here we consider the constraints for intervals of edges in a tour. Each restricted tour is an extension of a pyramidal tour and the algorithms can be applied for special cases of the traveling salesman problem.
