Edgeconvex Circuits and the Traveling Salesman Problem

Abstract

This paper will continue certain investigations into the geometric nature of the well-known traveling salesman problem: that of determining the extreme Hamiltonian circuits (H-circuits) of a graph.