Build (method = -2) #dp: 19318 Step-3' Graph: 179 vertices and 533 arcs (0.10s) Step-4' Graph: 18 vertices and 211 arcs (0.10s) #V4/#V3 = 0.10 #A4/#A3 = 0.40 Ready! (0.10s) Optimize a model with 64 rows, 212 columns and 604 nonzeros Presolve removed 6 rows and 6 columns Presolve time: 0.00s Presolved: 58 rows, 206 columns, 588 nonzeros Variable types: 0 continuous, 206 integer (154 binary) Found heuristic solution: objective 46.0000000 Optimize a model with 58 rows, 206 columns and 588 nonzeros Presolved: 58 rows, 206 columns, 588 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 2.290e+02 Factor NZ : 7.200e+02 Factor Ops : 1.361e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 3.42519208e+02 -4.01529960e+02 6.40e+01 1.03e-01 3.78e+00 0s 1 6.78562058e+01 -8.01705976e+01 4.33e+00 2.78e-16 4.76e-01 0s 2 1.87690382e+01 -2.05963907e+00 3.83e-04 4.44e-16 5.06e-02 0s 3 1.26695571e+01 1.10148859e+01 3.01e-06 1.25e-16 3.99e-03 0s 4 1.25004007e+01 1.24978657e+01 6.65e-15 1.72e-16 6.09e-06 0s 5 1.25000000e+01 1.25000000e+01 8.08e-15 3.03e-16 6.13e-12 0s Barrier solved model in 5 iterations and 0.00 seconds Optimal objective 1.25000000e+01 Root relaxation: objective 1.250000e+01, 138 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 4 46.00000 12.50000 72.8% - 0s H 0 0 13.0000000 12.50000 3.85% - 0s Explored 0 nodes (256 simplex iterations) in 0.01 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.11 seconds Gurobi run time: 0.01 seconds Total run time: 0.12 seconds Objective: 13 Solution: 1 x [13, 18, 27, 41] 1 x [11, 23, 27, 31] 1 x [1, 7, 22, 37] 1 x [8, 21, 30, 39] 1 x [6, 12, 31, 44] 1 x [2, 14, 28, 40] 1 x [34, 36, 43, 43] 1 x [2, 25, 33, 45] 1 x [19, 26] 1 x [15, 16, 35, 38] 1 x [3, 5, 20, 32] 1 x [4, 10, 29, 46] 1 x [9, 17, 24, 42]