Build (method = -2) #dp: 49018 Step-3' Graph: 974 vertices and 11696 arcs (0.40s) Step-4' Graph: 866 vertices and 11483 arcs (0.41s) #V4/#V3 = 0.89 #A4/#A3 = 0.98 Ready! (0.41s) Optimize a model with 909 rows, 11484 columns and 32722 nonzeros Presolve removed 44 rows and 48 columns Presolve time: 0.33s Presolved: 865 rows, 11436 columns, 32809 nonzeros Variable types: 0 continuous, 11436 integer (8404 binary) Found heuristic solution: objective 34.0000000 Optimize a model with 865 rows, 11436 columns and 32809 nonzeros Presolve removed 3 rows and 3 columns Presolved: 862 rows, 11433 columns, 32817 nonzeros Root barrier log... Ordering time: 0.03s Barrier statistics: AA' NZ : 2.202e+04 Factor NZ : 8.317e+04 (roughly 6 MBytes of memory) Factor Ops : 1.119e+07 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 3.07181639e+03 -5.36077156e+04 5.92e+04 1.37e-01 2.10e+01 0s 1 8.28680600e+02 -1.91936748e+04 1.13e+04 7.77e-16 4.24e+00 0s 2 2.84833088e+02 -1.07711048e+04 1.84e+03 8.88e-16 1.01e+00 0s 3 1.60865271e+02 -2.37767376e+03 4.16e+02 1.39e-15 2.30e-01 0s 4 9.18654399e+01 -4.88181246e+02 1.32e+02 1.14e-15 6.17e-02 0s 5 5.03760110e+01 -2.54963497e+02 4.26e+01 1.25e-15 2.46e-02 0s 6 3.37822756e+01 -1.32475856e+02 2.06e+01 8.22e-16 1.23e-02 0s 7 2.01943057e+01 -6.92000782e+01 7.40e+00 6.68e-16 5.53e-03 0s 8 1.49166958e+01 -4.34410643e+01 3.70e+00 7.65e-16 3.26e-03 0s 9 1.16045965e+01 -2.64047471e+01 2.29e+00 6.98e-16 2.02e-03 0s 10 9.24577785e+00 -2.09537420e+01 1.17e+00 8.61e-16 1.49e-03 0s 11 8.77816664e+00 -1.35975464e+01 9.17e-01 7.22e-16 1.09e-03 0s 12 7.99335176e+00 -3.16064552e+00 5.31e-01 7.31e-16 5.28e-04 0s 13 7.68014268e+00 1.30466409e+00 2.88e-01 9.99e-16 2.93e-04 0s 14 7.29424640e+00 4.56927563e+00 6.56e-02 5.74e-16 1.21e-04 0s 15 7.15540776e+00 6.76772787e+00 2.51e-03 5.64e-16 1.70e-05 0s 16 7.14292750e+00 7.14157887e+00 6.13e-14 4.44e-16 5.90e-08 0s 17 7.14285714e+00 7.14285714e+00 1.23e-13 4.40e-16 6.25e-14 0s Barrier solved model in 17 iterations and 0.34 seconds Optimal objective 7.14285714e+00 Root relaxation: objective 7.142857e+00, 8704 iterations, 0.49 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 7.14286 0 45 34.00000 7.14286 79.0% - 3s H 0 0 8.0000000 7.14286 10.7% - 3s Explored 0 nodes (16885 simplex iterations) in 3.42 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.47 seconds Gurobi run time: 3.42 seconds Total run time: 3.89 seconds Objective: 8 Solution: 1 x [1, 16, 21, 21, 29, 31, 36] 1 x [4, 8, 11, 33, 38, 43] 1 x [20, 28, 35, 39, 39, 40, 41] 1 x [2, 5, 12, 13, 24, 36, 42] 1 x [7, 14, 16, 17, 17, 22, 34] 1 x [6, 7, 18, 23, 25, 27, 32] 1 x [3, 9, 10, 15, 19, 26, 37] 1 x [30, 30]