Build (method = -2) #dp: 3381 Step-3' Graph: 31 vertices and 976 arcs (0.01s) Step-4' Graph: 31 vertices and 976 arcs (0.01s) #V4/#V3 = 1.00 #A4/#A3 = 1.00 Ready! (0.01s) Optimize a model with 91 rows, 977 columns and 2879 nonzeros Presolve removed 2 rows and 2 columns Presolve time: 0.01s Presolved: 89 rows, 975 columns, 2875 nonzeros Variable types: 0 continuous, 975 integer (84 binary) Found heuristic solution: objective 294.0000000 Found heuristic solution: objective 215.0000000 Optimize a model with 89 rows, 975 columns and 2875 nonzeros Presolved: 89 rows, 975 columns, 2875 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.288e+03 Factor NZ : 2.077e+03 Factor Ops : 7.224e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 7.65756725e+03 -1.35584486e+04 4.52e+03 3.01e-02 9.84e+01 0s 1 1.81561880e+03 -6.25997875e+03 5.39e+02 6.66e-16 1.40e+01 0s 2 5.04779575e+02 -2.85824329e+03 4.11e+01 1.15e-14 2.27e+00 0s 3 2.59957423e+02 -3.00757842e+02 1.92e+00 8.88e-16 2.88e-01 0s 4 1.37308220e+02 -6.42398470e+01 5.41e-01 3.33e-16 1.02e-01 0s 5 9.78540564e+01 -1.14996250e+01 2.62e-01 2.22e-16 5.49e-02 0s 6 8.00217116e+01 3.03737721e+01 1.31e-01 2.24e-16 2.49e-02 0s 7 7.31342372e+01 4.70416018e+01 7.02e-02 2.22e-16 1.30e-02 0s 8 7.02088651e+01 5.89062121e+01 3.93e-02 2.22e-16 5.64e-03 0s 9 6.88103812e+01 6.17856296e+01 2.42e-02 2.22e-16 3.50e-03 0s 10 6.72498824e+01 6.66687481e+01 2.64e-03 2.22e-16 2.89e-04 0s 11 6.69014975e+01 6.68961498e+01 1.32e-05 2.22e-16 2.66e-06 0s 12 6.69000015e+01 6.68999962e+01 7.52e-14 3.33e-16 2.66e-09 0s 13 6.69000000e+01 6.69000000e+01 2.13e-13 2.22e-16 2.66e-12 0s Barrier solved model in 13 iterations and 0.01 seconds Optimal objective 6.69000000e+01 Root relaxation: objective 6.690000e+01, 871 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 66.90000 0 21 215.00000 66.90000 68.9% - 0s H 0 0 68.0000000 66.90000 1.62% - 0s H 0 0 67.0000000 66.90000 0.15% - 0s Explored 0 nodes (1123 simplex iterations) in 0.06 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 6.700000000000e+01, best bound 6.700000000000e+01, gap 0.0% Preprocessing time: 0.02 seconds Gurobi run time: 0.06 seconds Total run time: 0.08 seconds Objective: 67 Solution: 4 x [34, 39, 54] 1 x [9, 37, 38, 47, 54] 6 x [2, 34, 46] 2 x [8, 15, 46, 52] 4 x [3, 5, 20, 33, 33] 2 x [10, 22, 30, 32, 37] 2 x [15, 17, 18, 25, 27, 29, 45] 3 x [12, 16, 28, 59] 1 x [21, 21, 40, 41, 59] 3 x [35, 42, 49, 50, 53, 55] 7 x [14, 28, 31, 36] 1 x [23, 36, 55, 56] 1 x [3, 12, 23, 55] 1 x [12, 25, 26, 30, 32, 37] 1 x [10, 16, 29, 30, 32, 37, 38] 1 x [6, 9, 23, 43, 55] 6 x [6, 9, 11, 23, 47] 2 x [4, 6, 11, 27, 29, 42, 48] 1 x [1, 6, 11, 16, 29, 48] 5 x [25, 35, 49, 58, 60] 2 x [21, 24, 40, 51, 60] 1 x [14, 19, 60, 60] 1 x [7, 9, 13, 32, 44, 53, 55] 1 x [8, 14, 15, 27, 52] 2 x [8, 37, 37, 52] 1 x [3, 8, 13, 15, 17, 49] 4 x [1, 5, 7, 13, 32, 44, 57] 1 x [11, 13, 16, 29, 29, 32, 43, 44, 48]