Build (method = -2) #dp: 9349 Step-3' Graph: 294 vertices and 1287 arcs (0.07s) Step-4' Graph: 160 vertices and 1023 arcs (0.07s) #V4/#V3 = 0.54 #A4/#A3 = 0.79 Ready! (0.07s) Optimize a model with 189 rows, 1024 columns and 2754 nonzeros Presolve removed 28 rows and 57 columns Presolve time: 0.03s Presolved: 161 rows, 967 columns, 2651 nonzeros Variable types: 0 continuous, 967 integer (368 binary) Found heuristic solution: objective 25.0000000 Optimize a model with 161 rows, 967 columns and 2651 nonzeros Presolved: 161 rows, 967 columns, 2651 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.649e+03 Factor NZ : 4.239e+03 Factor Ops : 1.365e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.99910257e+03 -6.37431722e+03 7.87e+03 1.75e-01 3.83e+01 0s 1 4.57879874e+02 -2.45682040e+03 1.65e+03 6.66e-16 8.04e+00 0s 2 8.66725780e+01 -9.88818977e+02 1.49e+02 6.66e-16 1.07e+00 0s 3 5.14567417e+01 -1.75983296e+02 1.56e+01 1.55e-15 1.52e-01 0s 4 2.82109352e+01 -4.19221683e+01 2.23e+00 5.55e-16 3.91e-02 0s 5 2.11577652e+01 -2.20573877e+01 1.50e+00 4.72e-16 2.38e-02 0s 6 1.36146437e+01 -9.71542351e+00 7.66e-01 4.63e-16 1.26e-02 0s 7 9.85596580e+00 -3.01498166e+00 4.35e-01 3.58e-16 6.89e-03 0s 8 7.11603867e+00 1.13225419e+00 1.60e-01 2.74e-16 3.15e-03 0s 9 7.17601336e+00 2.85042829e+00 1.21e-01 4.55e-16 2.27e-03 0s 10 6.80026663e+00 4.48750958e+00 5.98e-02 5.41e-16 1.20e-03 0s 11 6.27821099e+00 6.17366251e+00 4.70e-14 4.27e-16 5.37e-05 0s 12 6.25002914e+00 6.24992320e+00 3.03e-14 5.55e-16 5.44e-08 0s 13 6.25000000e+00 6.25000000e+00 5.40e-13 2.90e-16 5.45e-14 0s Barrier solved model in 13 iterations and 0.01 seconds Optimal objective 6.25000000e+00 Root relaxation: objective 6.250000e+00, 708 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 6.25000 0 29 25.00000 6.25000 75.0% - 0s H 0 0 9.0000000 6.25000 30.6% - 0s H 0 0 8.0000000 6.25000 21.9% - 0s H 0 0 7.0000000 6.25000 10.7% - 0s Explored 0 nodes (977 simplex iterations) in 0.09 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 7.000000000000e+00, best bound 7.000000000000e+00, gap 0.0% Preprocessing time: 0.08 seconds Gurobi run time: 0.09 seconds Total run time: 0.17 seconds Objective: 7 Solution: 1 x [1, 5, 7, 12, 18, 19, 22] 1 x [4, 4, 6, 14, 21, 26, 26] 1 x [2, 3, 7, 7, 15, 16, 29] 1 x [1, 3, 8, 10, 10, 13, 14, 20] 1 x [6, 9, 21, 21, 21, 25, 28, 29] 1 x [7, 10, 11, 17, 24, 24, 29] 1 x [6, 13, 21, 23, 26, 27]