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 | Time used by Miller-Tucker-Zemlin's potential formulation |
mtz_strong | Time used by a stronger version of Miller-Tucker-Zemlin's formulation |
scf | Time used by a single-commodity flow formulation |
mcf | Time used by a multi-commodity flow formulation |