Build (method = -2) #dp: 9400 Step-3' Graph: 360 vertices and 3634 arcs (0.07s) Step-4' Graph: 271 vertices and 3391 arcs (0.07s) #V4/#V3 = 0.75 #A4/#A3 = 0.93 Ready! (0.07s) Optimize a model with 306 rows, 3392 columns and 9634 nonzeros Presolve removed 20 rows and 24 columns Presolve time: 0.06s Presolved: 286 rows, 3368 columns, 9655 nonzeros Variable types: 0 continuous, 3368 integer (1918 binary) Found heuristic solution: objective 25.0000000 Optimize a model with 286 rows, 3368 columns and 9655 nonzeros Presolved: 286 rows, 3368 columns, 9655 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 5.801e+03 Factor NZ : 1.692e+04 (roughly 2 MBytes of memory) Factor Ops : 1.352e+06 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 5.26024858e+03 -2.42422067e+04 2.64e+04 3.29e-01 3.13e+01 0s 1 1.17179878e+03 -5.83957782e+03 6.37e+03 8.88e-16 7.23e+00 0s 2 2.45051298e+02 -2.87502279e+03 8.47e+02 7.77e-16 1.23e+00 0s 3 1.14600130e+02 -9.39562216e+02 1.22e+02 6.66e-16 2.49e-01 0s 4 6.57814931e+01 -2.50499713e+02 2.46e+01 7.22e-16 6.26e-02 0s 5 4.59443429e+01 -1.49754005e+02 8.60e+00 6.25e-16 3.36e-02 0s 6 3.74128983e+01 -7.69649054e+01 5.65e+00 8.52e-16 1.93e-02 0s 7 2.26875435e+01 -3.58480518e+01 2.43e+00 7.99e-16 9.50e-03 0s 8 1.59508742e+01 -1.63987170e+01 1.54e+00 7.08e-16 5.20e-03 0s 9 1.03779438e+01 -4.99096395e+00 7.04e-01 7.62e-16 2.41e-03 0s 10 8.95289027e+00 1.78660553e+00 4.02e-01 5.56e-16 1.11e-03 0s 11 8.11034774e+00 4.66233442e+00 1.90e-01 1.38e-15 5.27e-04 0s 12 7.47773257e+00 6.26107568e+00 5.53e-02 4.99e-16 1.83e-04 0s 13 7.20365174e+00 6.94445192e+00 9.74e-03 6.66e-16 3.89e-05 0s 14 7.14406322e+00 7.13598167e+00 2.58e-05 8.44e-16 1.20e-06 0s 15 7.14285747e+00 7.14285506e+00 6.80e-09 6.85e-16 3.58e-10 0s 16 7.14285714e+00 7.14285714e+00 1.57e-14 8.20e-16 3.58e-13 0s Barrier solved model in 16 iterations and 0.06 seconds Optimal objective 7.14285714e+00 Root relaxation: objective 7.142857e+00, 2060 iterations, 0.08 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 7.14286 0 49 25.00000 7.14286 71.4% - 0s H 0 0 8.0000000 7.14286 10.7% - 0s Explored 0 nodes (4666 simplex iterations) in 0.52 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 8.000000000000e+00, best bound 8.000000000000e+00, gap 0.0% Preprocessing time: 0.09 seconds Gurobi run time: 0.52 seconds Total run time: 0.61 seconds Objective: 8 Solution: 1 x [1, 5, 11, 20, 26, 28, 30] 1 x [2, 2, 19, 21, 25, 28, 34] 1 x [5, 11, 14, 20, 25, 28, 30] 1 x [3, 12, 15, 25, 29, 31, 32] 1 x [8, 10, 13, 14, 24, 29, 33] 1 x [4, 8, 8, 9, 18, 23, 27] 1 x [5, 6, 7, 16, 16, 22, 35] 1 x [17]