Build (method = -2) #dp: 2262 Step-3' Graph: 102 vertices and 1077 arcs (0.01s) Step-4' Graph: 102 vertices and 1077 arcs (0.01s) #V4/#V3 = 1.00 #A4/#A3 = 1.00 Ready! (0.01s) Optimize a model with 140 rows, 1078 columns and 3034 nonzeros Presolve removed 25 rows and 27 columns Presolve time: 0.03s Presolved: 115 rows, 1051 columns, 2990 nonzeros Variable types: 0 continuous, 1051 integer (553 binary) Found heuristic solution: objective 26.0000000 Optimize a model with 115 rows, 1051 columns and 2990 nonzeros Presolved: 115 rows, 1051 columns, 2990 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 2.085e+03 Factor NZ : 4.319e+03 Factor Ops : 2.129e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.41964883e+03 -3.33295108e+03 2.53e+03 1.62e-01 1.37e+01 0s 1 3.08216123e+02 -1.57180422e+03 4.63e+02 5.55e-16 2.83e+00 0s 2 8.45665657e+01 -5.99652453e+02 3.82e+01 3.61e-16 4.61e-01 0s 3 4.15409099e+01 -5.96241077e+01 3.60e+00 3.89e-16 5.67e-02 0s 4 2.97202203e+01 -1.73900262e+01 1.04e+00 3.26e-16 2.39e-02 0s 5 2.56803665e+01 3.54117290e-01 5.67e-01 3.87e-16 1.25e-02 0s 6 2.17612633e+01 9.71120749e+00 2.41e-01 3.62e-16 5.88e-03 0s 7 1.94372947e+01 1.32977023e+01 1.21e-01 2.77e-16 2.99e-03 0s 8 1.83974903e+01 1.51591167e+01 7.38e-02 1.93e-16 1.58e-03 0s 9 1.74754458e+01 1.60339314e+01 2.65e-02 2.82e-16 6.98e-04 0s 10 1.70257841e+01 1.67071651e+01 1.86e-03 2.30e-16 1.52e-04 0s 11 1.70003459e+01 1.69992283e+01 4.66e-06 3.13e-16 5.33e-07 0s 12 1.70000004e+01 1.69999992e+01 4.26e-14 2.80e-16 5.33e-10 0s 13 1.70000000e+01 1.70000000e+01 4.08e-14 3.55e-16 9.48e-16 0s Barrier solved model in 13 iterations and 0.01 seconds Optimal objective 1.70000000e+01 Root relaxation: objective 1.700000e+01, 611 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 17.00000 0 8 26.00000 17.00000 34.6% - 0s H 0 0 17.0000000 17.00000 0.0% - 0s Explored 0 nodes (1230 simplex iterations) in 0.08 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.700000000000e+01, best bound 1.700000000000e+01, gap 0.0% Preprocessing time: 0.02 seconds Gurobi run time: 0.08 seconds Total run time: 0.10 seconds Objective: 17 Solution: 1 x [5, 9, 38] 1 x [15, 37] 2 x [7, 10, 36] 1 x [18, 35] 1 x [20, 34] 1 x [13, 34] 1 x [2, 5, 14, 33] 1 x [3, 19, 32] 1 x [6, 6, 11, 32] 1 x [7, 17, 31] 1 x [1, 21, 30] 1 x [23, 29] 1 x [24, 28] 1 x [4, 22, 27] 1 x [3, 5, 8, 13, 26] 1 x [7, 12, 16, 25]