Build (method = -2) #dp: 779 Step-3' Graph: 58 vertices and 175 arcs (0.00s) Step-4' Graph: 13 vertices and 85 arcs (0.00s) #V4/#V3 = 0.22 #A4/#A3 = 0.49 Ready! (0.00s) Optimize a model with 51 rows, 86 columns and 237 nonzeros Presolve removed 34 rows and 46 columns Presolve time: 0.00s Presolved: 17 rows, 40 columns, 98 nonzeros Variable types: 0 continuous, 40 integer (9 binary) Found heuristic solution: objective 29.0000000 Found heuristic solution: objective 25.0000000 Optimize a model with 17 rows, 40 columns and 98 nonzeros Presolved: 17 rows, 40 columns, 98 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 3.100e+01 Factor NZ : 1.530e+02 Factor Ops : 1.785e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 3.06756650e+02 -2.04585722e+02 4.08e+01 2.22e-16 1.64e+01 0s 1 6.48202587e+01 -6.28266308e+01 2.93e+00 6.66e-16 2.00e+00 0s 2 3.36437116e+01 4.54058624e+00 1.40e-01 5.66e-15 3.44e-01 0s 3 2.61027119e+01 2.24243302e+01 1.97e-03 4.30e-16 4.27e-02 0s 4 2.50092791e+01 2.49502289e+01 6.72e-06 7.77e-16 6.86e-04 0s Barrier performed 4 iterations in 0.00 seconds Objective cutoff exceeded Root relaxation: cutoff, 0 iterations, 0.00 seconds Explored 0 nodes (0 simplex iterations) in 0.00 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 2.500000000000e+01, best bound 2.500000000000e+01, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.01 seconds Objective: 25 Solution: 1 x [13, 38] 1 x [15, 37] 1 x [14, 37] 1 x [16, 36] 1 x [11, 35] 2 x [1, 35] 1 x [10, 34] 1 x [8, 33] 1 x [22, 32] 1 x [7, 32] 1 x [24, 31] 1 x [5, 31] 1 x [25, 30] 1 x [2, 30] 1 x [26, 29] 1 x [27, 28] 1 x [4, 24] 1 x [20, 23] 1 x [3, 23] 1 x [19, 21] 1 x [6, 19] 1 x [17, 18] 1 x [9, 18] 1 x [8, 12]