Build (method = -2) #dp: 33500 Step-3' Graph: 407 vertices and 3182 arcs (0.32s) Step-4' Graph: 263 vertices and 2895 arcs (0.32s) #V4/#V3 = 0.65 #A4/#A3 = 0.91 Ready! (0.32s) Optimize a model with 307 rows, 2896 columns and 8165 nonzeros Presolve removed 24 rows and 24 columns Presolve time: 0.05s Presolved: 283 rows, 2872 columns, 8209 nonzeros Variable types: 0 continuous, 2872 integer (2031 binary) Found heuristic solution: objective 39.0000000 Optimize a model with 283 rows, 2872 columns and 8209 nonzeros Presolved: 283 rows, 2872 columns, 8209 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 5.184e+03 Factor NZ : 1.412e+04 (roughly 1 MByte of memory) Factor Ops : 8.981e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 5.00766964e+03 -2.10652633e+04 2.79e+04 2.21e-01 4.44e+01 0s 1 1.20349943e+03 -6.28247471e+03 6.21e+03 7.77e-16 9.84e+00 0s 2 1.78239355e+02 -2.24398991e+03 5.44e+02 1.11e-15 1.13e+00 0s 3 6.64148980e+01 -5.28678738e+02 8.64e+01 1.28e-15 2.05e-01 0s 4 3.09712551e+01 -1.23955717e+02 1.46e+01 8.60e-16 4.22e-02 0s 5 1.77556390e+01 -4.86508723e+01 3.88e+00 7.08e-16 1.49e-02 0s 6 1.22293079e+01 -2.39149858e+01 1.57e+00 6.07e-16 7.31e-03 0s 7 9.83053441e+00 -1.47526963e+01 9.34e-01 6.25e-16 4.77e-03 0s 8 8.14290528e+00 6.03577624e-01 3.83e-01 6.11e-16 1.41e-03 0s 9 8.05697850e+00 2.47806384e+00 3.07e-01 6.67e-16 1.03e-03 0s 10 7.48816901e+00 3.92115177e+00 1.62e-01 7.74e-16 6.45e-04 0s 11 7.59178765e+00 6.57050049e+00 5.85e-04 4.40e-16 1.78e-04 0s 12 7.14655551e+00 7.08600500e+00 9.82e-06 5.45e-16 1.05e-05 0s 13 7.14285773e+00 7.14285003e+00 2.84e-14 4.31e-16 1.34e-09 0s 14 7.14285714e+00 7.14285714e+00 8.35e-13 4.77e-16 1.34e-12 0s Barrier solved model in 14 iterations and 0.05 seconds Optimal objective 7.14285714e+00 Root relaxation: objective 7.142857e+00, 2251 iterations, 0.07 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 7.14286 0 10 39.00000 7.14286 81.7% - 0s H 0 0 8.0000000 7.14286 10.7% - 0s Explored 0 nodes (4069 simplex iterations) in 0.36 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.35 seconds Gurobi run time: 0.36 seconds Total run time: 0.71 seconds Objective: 8 Solution: 1 x [6, 18, 37, 38, 40, 40] 1 x [5, 18, 32, 33, 34, 35, 42] 1 x [1, 10, 12, 15, 17, 19] 1 x [1, 8, 14, 16, 25, 27, 41] 1 x [9, 10, 13, 20, 44] 1 x [11, 23, 26, 28, 30, 31, 36] 1 x [2, 3, 4, 7, 29, 32, 41] 1 x [21, 22, 24, 39, 43]