Build (method = -2) #dp: 3567 Step-3' Graph: 138 vertices and 795 arcs (0.02s) Step-4' Graph: 104 vertices and 727 arcs (0.02s) #V4/#V3 = 0.75 #A4/#A3 = 0.91 Ready! (0.02s) Optimize a model with 144 rows, 728 columns and 1981 nonzeros Presolve removed 20 rows and 22 columns Presolve time: 0.02s Presolved: 124 rows, 706 columns, 1943 nonzeros Variable types: 0 continuous, 706 integer (458 binary) Found heuristic solution: objective 28.0000000 Optimize a model with 124 rows, 706 columns and 1943 nonzeros Presolved: 124 rows, 706 columns, 1943 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.419e+03 Factor NZ : 3.823e+03 Factor Ops : 1.404e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.69428641e+03 -4.62933299e+03 3.83e+03 2.31e-01 2.75e+01 0s 1 3.37793305e+02 -1.48899311e+03 6.43e+02 5.55e-16 4.81e+00 0s 2 8.78892294e+01 -4.33758434e+02 7.57e+01 1.33e-15 7.25e-01 0s 3 3.86256682e+01 -7.65940504e+01 6.36e+00 6.66e-16 1.05e-01 0s 4 2.75543171e+01 -2.03529653e+01 1.90e+00 3.40e-16 3.78e-02 0s 5 2.20333141e+01 -4.16386393e+00 8.89e-01 2.22e-16 1.97e-02 0s 6 1.93937635e+01 7.61958311e+00 4.90e-01 2.22e-16 8.68e-03 0s 7 1.82880132e+01 1.01007977e+01 3.51e-01 1.81e-16 5.99e-03 0s 8 1.72951989e+01 1.28964998e+01 1.78e-01 2.22e-16 3.16e-03 0s 9 1.64379469e+01 1.43891122e+01 6.14e-02 2.22e-16 1.45e-03 0s 10 1.59732953e+01 1.50686541e+01 1.66e-02 2.22e-16 6.39e-04 0s 11 1.57449176e+01 1.53627182e+01 4.94e-03 2.22e-16 2.70e-04 0s 12 1.56645158e+01 1.55020907e+01 1.95e-03 1.53e-16 1.15e-04 0s 13 1.56382839e+01 1.55738634e+01 1.00e-03 2.22e-16 4.54e-05 0s 14 1.56220929e+01 1.56024036e+01 3.54e-04 1.11e-16 1.39e-05 0s 15 1.56133942e+01 1.56131023e+01 2.41e-14 2.98e-16 2.06e-07 0s 16 1.56133334e+01 1.56133331e+01 1.07e-14 2.30e-16 2.06e-10 0s 17 1.56133333e+01 1.56133333e+01 2.16e-14 1.39e-16 2.06e-13 0s Barrier solved model in 17 iterations and 0.01 seconds Optimal objective 1.56133333e+01 Root relaxation: objective 1.561333e+01, 297 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 15.61333 0 41 28.00000 15.61333 44.2% - 0s H 0 0 17.0000000 15.61333 8.16% - 0s 0 0 15.63636 0 51 17.00000 15.63636 8.02% - 0s 0 0 15.63636 0 62 17.00000 15.63636 8.02% - 0s H 0 0 16.0000000 15.63636 2.27% - 0s Cutting planes: Gomory: 1 Explored 0 nodes (909 simplex iterations) in 0.13 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.600000000000e+01, best bound 1.600000000000e+01, gap 0.0% Preprocessing time: 0.03 seconds Gurobi run time: 0.13 seconds Total run time: 0.16 seconds Objective: 16 Solution: 1 x [10, 14, 40] 1 x [2, 19, 39] 1 x [11, 13, 38] 1 x [2, 4, 18, 37] 1 x [1, 3, 21, 36] 1 x [7, 18, 35] 1 x [24, 34] 1 x [6, 20, 33] 1 x [5, 8, 16, 32] 1 x [1, 25, 31] 1 x [27, 30] 1 x [2, 17, 17, 29] 1 x [3, 12, 17, 28] 1 x [9, 23, 27] 1 x [22, 26] 1 x [15, 18, 25]