Build (method = -2) #dp: 3627 Step-3' Graph: 193 vertices and 1134 arcs (0.02s) Step-4' Graph: 91 vertices and 930 arcs (0.02s) #V4/#V3 = 0.47 #A4/#A3 = 0.82 Ready! (0.02s) Optimize a model with 151 rows, 931 columns and 2615 nonzeros Presolve removed 29 rows and 29 columns Presolve time: 0.01s Presolved: 122 rows, 902 columns, 2590 nonzeros Variable types: 0 continuous, 902 integer (790 binary) Found heuristic solution: objective 41.0000000 Optimize a model with 122 rows, 902 columns and 2590 nonzeros Presolved: 122 rows, 902 columns, 2590 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.338e+03 Factor NZ : 3.561e+03 Factor Ops : 1.295e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 3.57836324e+03 -3.57595262e+03 8.42e+03 2.77e-01 1.41e+01 0s 1 6.37147369e+02 -7.12568049e+02 1.45e+03 1.22e-15 2.35e+00 0s 2 9.69026984e+01 -1.40689905e+02 1.34e+02 1.33e-15 2.69e-01 0s 3 3.74409290e+01 -6.05162942e+00 1.90e+01 7.77e-16 4.08e-02 0s 4 2.43298762e+01 6.40689682e+00 1.07e+00 6.66e-16 1.06e-02 0s 5 2.22278038e+01 1.73187417e+01 2.97e-01 5.55e-16 2.77e-03 0s 6 2.08735677e+01 1.81664925e+01 7.15e-02 1.08e-15 1.51e-03 0s 7 2.04085183e+01 1.91049000e+01 2.55e-02 9.00e-16 7.25e-04 0s 8 2.01355068e+01 1.96805240e+01 2.85e-03 8.19e-16 2.52e-04 0s 9 2.00547143e+01 1.98678442e+01 6.21e-04 7.26e-16 1.04e-04 0s 10 2.00219440e+01 1.99502302e+01 1.55e-04 6.66e-16 3.98e-05 0s 11 2.00060122e+01 1.99918321e+01 1.57e-05 8.88e-16 7.86e-06 0s 12 2.00027389e+01 1.99992337e+01 4.16e-06 5.99e-16 1.94e-06 0s 13 2.00019322e+01 2.00011411e+01 1.32e-06 7.77e-16 4.39e-07 0s 14 2.00015834e+01 2.00015733e+01 5.93e-09 5.96e-16 5.58e-09 0s 15 2.00015798e+01 2.00015798e+01 1.99e-13 8.88e-16 7.03e-14 0s Barrier solved model in 15 iterations and 0.01 seconds Optimal objective 2.00015798e+01 Root relaxation: objective 2.000158e+01, 110 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 20.00158 0 62 41.00000 20.00158 51.2% - 0s H 0 0 21.0000000 20.00158 4.75% - 0s Explored 0 nodes (239 simplex iterations) in 0.04 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 2.100000000000e+01, best bound 2.100000000000e+01, gap 0.0% Preprocessing time: 0.03 seconds Gurobi run time: 0.04 seconds Total run time: 0.06 seconds Objective: 21 Solution: 1 x [40, 41, 42] 1 x [8, 9, 58] 1 x [22, 23, 24] 1 x [7, 37] 1 x [5, 10, 44] 1 x [15, 36, 60] 1 x [25, 50, 53] 1 x [16, 17, 18] 1 x [3, 28, 30] 1 x [20, 39, 48] 1 x [55, 56, 57] 1 x [6, 34, 59] 1 x [4, 11, 29] 1 x [1, 12, 26] 1 x [43] 1 x [14, 38, 49] 1 x [2, 19, 21] 1 x [31, 32, 33] 1 x [51, 52, 54] 1 x [13, 46, 47] 1 x [27, 35, 45]