Build (method = -2) #dp: 50344 Step-3' Graph: 1008 vertices and 11905 arcs (0.36s) Step-4' Graph: 917 vertices and 11725 arcs (0.37s) #V4/#V3 = 0.91 #A4/#A3 = 0.98 Ready! (0.37s) Optimize a model with 962 rows, 11726 columns and 33346 nonzeros Presolve removed 52 rows and 53 columns Presolve time: 0.38s Presolved: 910 rows, 11673 columns, 33477 nonzeros Variable types: 0 continuous, 11673 integer (9214 binary) Found heuristic solution: objective 34.0000000 Optimize a model with 910 rows, 11673 columns and 33477 nonzeros Presolve removed 3 rows and 3 columns Presolved: 907 rows, 11670 columns, 33479 nonzeros Root barrier log... Ordering time: 0.02s Barrier statistics: AA' NZ : 2.335e+04 Factor NZ : 1.141e+05 (roughly 6 MBytes of memory) Factor Ops : 2.082e+07 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.90821541e+03 -4.68019787e+04 5.32e+04 8.07e-02 1.80e+01 0s 1 5.71184066e+02 -1.77517708e+04 1.18e+04 7.77e-16 4.17e+00 0s 2 2.11910913e+02 -1.07107501e+04 2.18e+03 9.99e-16 1.07e+00 0s 3 1.18184695e+02 -2.12277355e+03 4.10e+02 8.88e-16 2.07e-01 0s 4 6.47002017e+01 -5.40118849e+02 9.34e+01 7.77e-16 5.04e-02 0s 5 3.26276956e+01 -2.42459586e+02 2.44e+01 7.22e-16 1.79e-02 0s 6 1.99217995e+01 -1.00016064e+02 8.49e+00 6.97e-16 7.02e-03 0s 7 1.21281413e+01 -4.55109601e+01 2.20e+00 1.11e-15 2.86e-03 0s 8 1.04161316e+01 -2.56249037e+01 1.43e+00 6.78e-16 1.74e-03 0s 9 8.76383703e+00 -1.20446110e+01 8.07e-01 7.77e-16 9.71e-04 0s 10 8.02207648e+00 -3.95600841e+00 4.60e-01 9.99e-16 5.45e-04 0s 11 7.73120377e+00 -2.52215875e+00 3.41e-01 8.04e-16 4.61e-04 0s 12 7.57645141e+00 4.41219059e+00 2.68e-01 5.76e-16 1.44e-04 0s 13 7.40911743e+00 5.44004474e+00 1.65e-01 7.01e-16 8.88e-05 0s 14 7.18871025e+00 6.91195430e+00 2.86e-02 6.04e-16 1.24e-05 0s 15 7.14411423e+00 7.12992400e+00 3.84e-04 6.08e-16 6.15e-07 0s 16 7.14285857e+00 7.14284421e+00 1.21e-13 7.04e-16 6.15e-10 0s 17 7.14285714e+00 7.14285713e+00 7.88e-14 7.03e-16 6.15e-13 0s Barrier solved model in 17 iterations and 0.46 seconds Optimal objective 7.14285714e+00 Root relaxation: objective 7.142857e+00, 8770 iterations, 0.64 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 7.14286 0 49 34.00000 7.14286 79.0% - 4s H 0 0 8.0000000 7.14286 10.7% - 4s Explored 0 nodes (22368 simplex iterations) in 4.91 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.42 seconds Gurobi run time: 4.91 seconds Total run time: 5.32 seconds Objective: 8 Solution: 1 x [3, 8, 20, 26, 39, 41] 1 x [2, 6, 9, 23, 38] 1 x [1, 10, 24, 28, 30, 34, 35] 1 x [5, 9, 12, 17, 27, 40, 40] 1 x [11, 16, 18, 33, 36, 42] 1 x [14, 15, 25, 29, 31, 32] 1 x [7, 13, 18, 22, 34, 43] 1 x [4, 19, 21, 37, 42, 44, 45]