Build (method = -2) #dp: 329 Step-3' Graph: 39 vertices and 177 arcs (0.00s) Step-4' Graph: 15 vertices and 129 arcs (0.00s) #V4/#V3 = 0.38 #A4/#A3 = 0.73 Ready! (0.00s) Optimize a model with 40 rows, 130 columns and 364 nonzeros Presolve removed 10 rows and 12 columns Presolve time: 0.00s Presolved: 30 rows, 118 columns, 263 nonzeros Variable types: 0 continuous, 118 integer (99 binary) Found heuristic solution: objective 14.0000000 Optimize a model with 30 rows, 118 columns and 263 nonzeros Presolved: 30 rows, 118 columns, 263 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.290e+02 Factor NZ : 3.390e+02 Factor Ops : 4.667e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 5.87527201e+01 -4.27905900e+01 4.37e+01 6.00e-02 1.19e+00 0s 1 1.87315959e+01 -9.00747835e+00 6.35e-01 3.89e-16 1.31e-01 0s 2 1.29238018e+01 1.05470820e+01 9.50e-03 5.94e-03 1.04e-02 0s 3 1.25019167e+01 1.24768078e+01 6.38e-14 4.44e-16 1.06e-04 0s 4 1.25000019e+01 1.24999768e+01 2.66e-15 2.22e-16 1.06e-07 0s 5 1.25000000e+01 1.25000000e+01 1.78e-15 4.44e-16 1.06e-13 0s Barrier solved model in 5 iterations and 0.00 seconds Optimal objective 1.25000000e+01 Root relaxation: objective 1.250000e+01, 81 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 12.50000 0 3 14.00000 12.50000 10.7% - 0s H 0 0 13.0000000 12.50000 3.85% - 0s Explored 0 nodes (103 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 [6, 23] 1 x [10, 24] 1 x [9, 17] 1 x [2, 20] 1 x [13, 14] 1 x [4, 15] 1 x [1, 25] 1 x [8, 22] 1 x [7, 19] 1 x [12, 16] 1 x [5, 11] 1 x [21] 1 x [3, 18]