Build (method = -2) #dp: 3399 Step-3' Graph: 151 vertices and 444 arcs (0.03s) Step-4' Graph: 16 vertices and 174 arcs (0.03s) #V4/#V3 = 0.11 #A4/#A3 = 0.39 Ready! (0.03s) Optimize a model with 62 rows, 175 columns and 499 nonzeros Presolve removed 2 rows and 2 columns Presolve time: 0.00s Presolved: 60 rows, 173 columns, 495 nonzeros Variable types: 0 continuous, 173 integer (39 binary) Found heuristic solution: objective 106.0000000 Found heuristic solution: objective 102.0000000 Optimize a model with 60 rows, 173 columns and 495 nonzeros Presolved: 60 rows, 173 columns, 495 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.850e+02 Factor NZ : 6.510e+02 Factor Ops : 1.199e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 3.14849891e+02 -3.32411850e+02 5.87e+01 3.08e-02 4.06e+00 0s 1 7.27655368e+01 -1.31404931e+02 1.49e-13 2.22e-16 5.57e-01 0s 2 4.53400510e+01 2.79503358e+01 3.82e-14 3.33e-16 4.61e-02 0s 3 4.00466091e+01 3.97226314e+01 1.46e-13 1.42e-16 8.55e-04 0s 4 4.00000473e+01 3.99997233e+01 4.90e-14 3.33e-16 8.55e-07 0s 5 4.00000000e+01 4.00000000e+01 2.03e-14 3.33e-16 8.55e-13 0s Barrier solved model in 5 iterations and 0.00 seconds Optimal objective 4.00000000e+01 Root relaxation: objective 4.000000e+01, 140 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 (140 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: 1 x [18, 36, 46] 4 x [17, 26, 46] 3 x [11, 35, 45] 3 x [14, 44, 44] 1 x [27, 31, 43] 3 x [15, 38, 42] 3 x [10, 22, 41] 1 x [2, 2, 40] 2 x [1, 34, 39] 1 x [12, 28, 38] 2 x [4, 25, 37] 2 x [11, 23, 33] 1 x [3, 3, 32] 1 x [5, 7, 31] 3 x [6, 9, 30] 1 x [16, 16, 29] 1 x [8, 13, 24] 1 x [8, 11, 21] 5 x [13, 19, 20] 1 x [1, 8, 15]