Build (method = -2) #dp: 599 Step-3' Graph: 51 vertices and 155 arcs (0.00s) Step-4' Graph: 12 vertices and 77 arcs (0.00s) #V4/#V3 = 0.24 #A4/#A3 = 0.50 Ready! (0.00s) Optimize a model with 47 rows, 78 columns and 214 nonzeros Presolve removed 30 rows and 37 columns Presolve time: 0.00s Presolved: 17 rows, 41 columns, 101 nonzeros Variable types: 0 continuous, 41 integer (8 binary) Found heuristic solution: objective 33.0000000 Found heuristic solution: objective 25.0000000 Optimize a model with 17 rows, 41 columns and 101 nonzeros Presolve removed 0 rows and 1 columns Presolved: 17 rows, 40 columns, 99 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.65188563e+02 -3.51445727e+02 7.42e+01 1.11e-16 2.40e+01 0s 1 8.86082805e+01 -1.01982539e+02 8.63e+00 8.88e-16 3.46e+00 0s 2 3.57515162e+01 2.65144222e+00 1.78e-15 1.55e-15 3.80e-01 0s 3 2.62373650e+01 1.62825530e+01 4.00e-15 6.66e-16 1.14e-01 0s 4 2.50445671e+01 2.46949972e+01 6.66e-15 4.44e-16 4.02e-03 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 [12, 35] 1 x [8, 34] 1 x [6, 33] 1 x [14, 32] 1 x [5, 32] 1 x [4, 31] 1 x [16, 30] 1 x [15, 30] 1 x [13, 30] 1 x [3, 30] 1 x [2, 29] 1 x [17, 28] 1 x [19, 27] 1 x [18, 27] 2 x [22, 26] 1 x [21, 26] 1 x [23, 25] 1 x [20, 24] 1 x [17, 17] 1 x [1, 16] 1 x [7, 13] 1 x [7, 11] 1 x [5, 10] 1 x [4, 9]