A problem asking for the shortest tour of a graph which visits each edge at least once. For an Eulerian graph, an Eulerian cycle is the optimal solution. In a tree, however, the path crosses each edge twice.

Eulerian cycle | traveling salesman problem