Build (method = -2) #dp: 3596 Step-3' Graph: 158 vertices and 466 arcs (0.03s) Step-4' Graph: 18 vertices and 186 arcs (0.03s) #V4/#V3 = 0.11 #A4/#A3 = 0.40 Ready! (0.03s) Optimize a model with 66 rows, 187 columns and 530 nonzeros Presolve removed 2 rows and 2 columns Presolve time: 0.00s Presolved: 64 rows, 185 columns, 526 nonzeros Variable types: 0 continuous, 185 integer (42 binary) Found heuristic solution: objective 103.0000000 Found heuristic solution: objective 102.0000000 Optimize a model with 64 rows, 185 columns and 526 nonzeros Presolved: 64 rows, 185 columns, 526 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.990e+02 Factor NZ : 6.690e+02 Factor Ops : 1.207e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 4.07898438e+02 -4.38239164e+02 7.71e+01 3.25e-02 4.78e+00 0s 1 9.50483988e+01 -1.49183886e+02 2.24e-13 2.22e-16 6.25e-01 0s 2 4.79945223e+01 1.82668106e+01 6.97e-14 3.33e-16 7.43e-02 0s 3 4.00952222e+01 3.95009340e+01 9.24e-14 2.22e-16 1.47e-03 0s 4 4.00000960e+01 3.99995017e+01 3.08e-14 2.22e-16 1.47e-06 0s 5 4.00000000e+01 4.00000000e+01 6.18e-14 3.33e-16 1.48e-12 0s Barrier solved model in 5 iterations and 0.00 seconds Optimal objective 4.00000000e+01 Root relaxation: objective 4.000000e+01, 141 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 40.0000000 40.00000 0.0% - 0s Explored 0 nodes (141 simplex iterations) in 0.01 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 4.000000000000e+01, best bound 4.000000000000e+01, gap 0.0% Preprocessing time: 0.04 seconds Gurobi run time: 0.01 seconds Total run time: 0.05 seconds Objective: 40 Solution: 4 x [28, 41, 48] 1 x [19, 33, 47] 1 x [31, 32, 46] 1 x [15, 27, 45] 1 x [2, 3, 45] 4 x [20, 35, 44] 3 x [37, 43, 43] 1 x [39, 39, 42] 1 x [34, 40, 40] 1 x [23, 35, 38] 1 x [5, 7, 38] 2 x [4, 18, 36] 1 x [8, 9, 32] 3 x [24, 29, 30] 1 x [9, 20, 26] 3 x [16, 22, 25] 2 x [6, 14, 22] 3 x [8, 12, 21] 1 x [9, 17, 19] 3 x [8, 10, 15] 2 x [1, 11, 13]