Build (method = -2) #dp: 4529 Step-3' Graph: 163 vertices and 482 arcs (0.02s) Step-4' Graph: 26 vertices and 208 arcs (0.02s) #V4/#V3 = 0.16 #A4/#A3 = 0.43 Ready! (0.02s) Optimize a model with 64 rows, 209 columns and 579 nonzeros Presolve removed 8 rows and 10 columns Presolve time: 0.00s Presolved: 56 rows, 199 columns, 555 nonzeros Variable types: 0 continuous, 199 integer (97 binary) Found heuristic solution: objective 23.0000000 Optimize a model with 56 rows, 199 columns and 555 nonzeros Presolved: 56 rows, 199 columns, 555 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 2.230e+02 Factor NZ : 6.720e+02 Factor Ops : 1.232e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 2.22635874e+02 -3.76028944e+02 8.03e+01 4.48e-02 3.31e+00 0s 1 4.80623458e+01 -1.06327253e+02 1.10e+00 3.89e-16 4.07e-01 0s 2 2.55642259e+01 -8.43900284e+00 9.41e-02 2.78e-16 8.49e-02 0s 3 1.30861213e+01 9.53758096e+00 4.47e-03 2.22e-16 8.69e-03 0s 4 1.25043018e+01 1.24899935e+01 1.82e-14 2.37e-16 3.51e-05 0s 5 1.25000000e+01 1.25000000e+01 1.03e-13 2.22e-16 3.92e-11 0s Barrier solved model in 5 iterations and 0.00 seconds Optimal objective 1.25000000e+01 Root relaxation: objective 1.250000e+01, 130 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 23.00000 12.50000 45.7% - 0s H 0 0 13.0000000 12.50000 3.85% - 0s Explored 0 nodes (203 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.03 seconds Gurobi run time: 0.01 seconds Total run time: 0.04 seconds Objective: 13 Solution: 1 x [27, 29, 35, 38] 1 x [27, 32, 37] 2 x [8, 13, 14, 36] 1 x [28, 28, 34] 1 x [5, 5, 5, 33] 1 x [6, 13, 19, 31] 1 x [1, 2, 17, 31] 1 x [17, 22, 22, 30] 1 x [18, 21, 25, 26] 1 x [10, 12, 16, 24] 1 x [7, 9, 15, 23] 1 x [3, 4, 11, 20]