Results obtained using Gurobi for solving the asymmetric traveling salesman problem, using models 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 |
| Solutions and bounds |
| Label | Description |
| inst | Instance name |
| mtz | Solutions obtained using Miller-Tucker-Zemlin's potential formulation |
| mtz_strong | Solutions obtained by the stronger version of Miller-Tucker-Zemlin's formulation |
| scf | Solutions obtained by the single-commodity flow formulation |
| mcf | Solutions obtained by the multi-commodity flow formulation |