Hop-indexed Circuit-based formulations for the Travelling Salesman Problem
Abstract
We discuss a new Hop-indexed Circuit-based formulation for the TSP. We show that the new formulation enhanced with some valid inequalities the new formulation 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).