Build (method = -2) #dp: 3686 Step-3' Graph: 158 vertices and 465 arcs (0.02s) Step-4' Graph: 15 vertices and 179 arcs (0.02s) #V4/#V3 = 0.09 #A4/#A3 = 0.38 Ready! (0.02s) Optimize a model with 64 rows, 180 columns and 516 nonzeros Presolve removed 2 rows and 2 columns Presolve time: 0.00s Presolved: 62 rows, 178 columns, 512 nonzeros Variable types: 0 continuous, 178 integer (45 binary) Found heuristic solution: objective 103.0000000 Optimize a model with 62 rows, 178 columns and 512 nonzeros Presolved: 62 rows, 178 columns, 512 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.900e+02 Factor NZ : 6.580e+02 Factor Ops : 1.201e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 3.11963191e+02 -3.27898246e+02 4.60e+01 2.51e-02 3.80e+00 0s 1 7.21381158e+01 -1.27912346e+02 3.06e-13 2.22e-16 5.31e-01 0s 2 4.50998950e+01 2.52186071e+01 1.12e-12 4.44e-15 5.13e-02 0s 3 4.00370945e+01 3.97454991e+01 3.46e-14 5.66e-15 7.48e-04 0s 4 4.00000377e+01 3.99997461e+01 1.03e-13 4.55e-15 7.48e-07 0s 5 4.00000000e+01 4.00000000e+01 4.44e-14 5.21e-15 7.48e-13 0s Barrier solved model in 5 iterations and 0.00 seconds Optimal objective 4.00000000e+01 Root relaxation: objective 4.000000e+01, 143 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 (143 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.03 seconds Gurobi run time: 0.01 seconds Total run time: 0.04 seconds Objective: 40 Solution: 2 x [32, 45, 49] 1 x [38, 44, 48] 3 x [37, 42, 47] 4 x [33, 38, 46] 3 x [20, 23, 43] 2 x [4, 29, 41] 3 x [11, 15, 41] 2 x [5, 18, 40] 1 x [21, 29, 39] 2 x [1, 8, 36] 2 x [12, 18, 35] 2 x [9, 13, 34] 1 x [18, 28, 31] 4 x [3, 16, 30] 1 x [17, 24, 27] 4 x [2, 7, 26] 1 x [14, 22, 25] 1 x [10, 13, 19] 1 x [1, 6, 8]