Build (method = -2) #dp: 2219 Step-3' Graph: 121 vertices and 848 arcs (0.01s) Step-4' Graph: 57 vertices and 720 arcs (0.01s) #V4/#V3 = 0.47 #A4/#A3 = 0.85 Ready! (0.01s) Optimize a model with 110 rows, 721 columns and 2053 nonzeros Presolve removed 12 rows and 13 columns Presolve time: 0.02s Presolved: 98 rows, 708 columns, 1891 nonzeros Variable types: 0 continuous, 708 integer (562 binary) Found heuristic solution: objective 48.0000000 Optimize a model with 98 rows, 708 columns and 1891 nonzeros Presolved: 98 rows, 708 columns, 1891 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.004e+03 Factor NZ : 2.330e+03 Factor Ops : 6.986e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.43937821e+03 -3.07432238e+03 4.57e+03 2.51e-01 1.60e+01 0s 1 3.26758247e+02 -8.11715705e+02 6.44e+02 4.44e-16 2.45e+00 0s 2 6.68144989e+01 -1.67121835e+02 5.67e+01 8.88e-16 2.94e-01 0s 3 3.12757679e+01 -9.28132946e+00 3.18e+00 6.66e-16 3.43e-02 0s 4 2.52043243e+01 6.00128585e+00 7.54e-01 4.44e-16 1.43e-02 0s 5 2.24576109e+01 1.63497710e+01 2.52e-01 4.44e-16 4.43e-03 0s 6 2.16586469e+01 1.75388286e+01 1.46e-01 4.44e-16 2.97e-03 0s 7 2.09284958e+01 1.84166573e+01 5.93e-02 6.66e-16 1.79e-03 0s 8 2.02880871e+01 1.94292272e+01 9.52e-03 8.88e-16 6.07e-04 0s 9 2.01436453e+01 1.96976123e+01 4.16e-03 4.44e-16 3.15e-04 0s 10 2.00491554e+01 1.99152204e+01 8.79e-04 5.55e-16 9.44e-05 0s 11 2.00211282e+01 1.99596880e+01 3.28e-04 3.33e-16 4.33e-05 0s 12 2.00056311e+01 1.99922523e+01 6.55e-05 4.44e-16 9.42e-06 0s 13 2.00004817e+01 1.99993590e+01 3.01e-06 6.66e-16 7.90e-07 0s 14 2.00000032e+01 1.99999980e+01 1.54e-13 8.88e-16 3.65e-09 0s 15 2.00000000e+01 2.00000000e+01 5.68e-14 5.55e-16 6.49e-15 0s Barrier solved model in 15 iterations and 0.01 seconds Optimal objective 2.00000000e+01 Root relaxation: objective 2.000000e+01, 63 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 20.00000 0 40 48.00000 20.00000 58.3% - 0s H 0 0 24.0000000 20.00000 16.7% - 0s H 0 0 21.0000000 20.00000 4.76% - 0s * 0 0 0 20.0000000 20.00000 0.0% - 0s Cutting planes: Gomory: 2 Zero half: 8 Explored 0 nodes (161 simplex iterations) in 0.06 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 2.000000000000e+01, best bound 2.000000000000e+01, gap 0.0% Preprocessing time: 0.02 seconds Gurobi run time: 0.06 seconds Total run time: 0.08 seconds Objective: 20 Solution: 1 x [17, 50, 52] 1 x [3, 7, 43] 1 x [1, 12, 42] 1 x [18, 38, 51] 1 x [10, 15, 35] 1 x [26, 44, 52] 1 x [1, 20, 26] 1 x [2, 25, 31] 1 x [29, 33, 49] 1 x [6, 23, 28] 1 x [6, 24, 27] 1 x [22, 34, 53] 1 x [8, 21, 32] 1 x [14, 18, 30] 1 x [13, 36, 37] 1 x [5, 9, 39] 1 x [4, 8, 41] 1 x [11, 19, 40] 1 x [47, 48, 53] 1 x [16, 45, 46]