Build (method = -2) #dp: 333 Step-3' Graph: 29 vertices and 163 arcs (0.00s) Step-4' Graph: 18 vertices and 141 arcs (0.00s) #V4/#V3 = 0.62 #A4/#A3 = 0.87 Ready! (0.00s) Optimize a model with 43 rows, 142 columns and 394 nonzeros Presolve removed 10 rows and 12 columns Presolve time: 0.00s Presolved: 33 rows, 130 columns, 293 nonzeros Variable types: 0 continuous, 130 integer (114 binary) Found heuristic solution: objective 13.0000000 Optimize a model with 33 rows, 130 columns and 293 nonzeros Presolved: 33 rows, 130 columns, 293 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.430e+02 Factor NZ : 4.180e+02 Factor Ops : 6.380e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 5.72915137e+01 -3.59961360e+01 3.59e+01 8.68e-02 9.38e-01 0s 1 1.87011300e+01 -8.54511463e+00 4.36e-01 6.94e-16 1.15e-01 0s 2 1.28993946e+01 9.98241579e+00 7.78e-03 9.89e-03 1.18e-02 0s 3 1.25033301e+01 1.24734608e+01 2.55e-15 8.88e-16 1.15e-04 0s Barrier performed 3 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 1.300000000000e+01, best bound 1.300000000000e+01, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.01 seconds Objective: 13 Solution: 1 x [9, 15] 1 x [3, 18] 1 x [8, 12] 1 x [14, 24] 1 x [11, 23] 1 x [7, 25] 1 x [2, 19] 1 x [10, 21] 1 x [5] 1 x [6, 13] 1 x [16, 17] 1 x [1, 20] 1 x [4, 22]