Hop-indexed Circuit-based formulations for the Traveling Salesman Problem

We discuss a new Hop-indexed Circuit-based formulation for the Traveling Salesman Problem (TSP). We show that the new formulation enhanced with some valid inequalities dominates the previous best (compact) formulations from the literature and that it produces very tight linear bounds (with emphasis on the so-called cumulative TSP).