Build (method = -2) #dp: 341 Step-3' Graph: 28 vertices and 125 arcs (0.00s) Step-4' Graph: 19 vertices and 107 arcs (0.00s) #V4/#V3 = 0.68 #A4/#A3 = 0.86 Ready! (0.00s) Optimize a model with 54 rows, 108 columns and 290 nonzeros Presolve removed 32 rows and 37 columns Presolve time: 0.00s Presolved: 22 rows, 71 columns, 176 nonzeros Variable types: 0 continuous, 71 integer (25 binary) Found heuristic solution: objective 42.0000000 Found heuristic solution: objective 38.0000000 Found heuristic solution: objective 33.0000000 Optimize a model with 22 rows, 71 columns and 176 nonzeros Presolved: 22 rows, 71 columns, 176 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 7.600e+01 Factor NZ : 1.980e+02 Factor Ops : 2.200e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 2.12628808e+02 -1.47223173e+02 9.41e+01 1.94e-01 7.60e+00 0s 1 6.33398425e+01 -3.92350493e+01 7.62e+00 3.89e-16 1.00e+00 0s 2 4.02188093e+01 1.83655570e+01 2.31e-02 2.22e-16 1.50e-01 0s 3 3.44174288e+01 3.12011952e+01 1.71e-03 1.35e-16 2.20e-02 0s 4 3.30314887e+01 3.29301269e+01 2.48e-05 1.32e-16 6.94e-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 3.300000000000e+01, best bound 3.300000000000e+01, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.01 seconds Objective: 33 Solution: 1 x [35] 3 x [34] 1 x [33] 2 x [32] 1 x [31] 2 x [30] 1 x [1, 30] 1 x [29] 1 x [2, 29] 1 x [4, 28] 1 x [4, 27] 1 x [3, 26] 2 x [5, 25] 1 x [7, 24] 1 x [23] 1 x [9, 22] 2 x [8, 21] 1 x [8, 20] 1 x [6, 19] 2 x [10, 18] 1 x [17] 1 x [11, 17] 1 x [16] 1 x [15] 1 x [14] 1 x [12, 13]