Traveling Salesman Problem: Results obtained for TSPLIB instances

Results obtained using Gurobi for solving the traveling salesman problem, using several cutting plane strategies described in Mathematical Optimization: Solving Problems using Python and Gurobi. CPU time limited to 3600 seconds. (Click on values for selecting data to display.)

Performance data
CPU time required
Number of solution failures