Build (method = -2) #dp: 3027 Step-3' Graph: 140 vertices and 411 arcs (0.03s) Step-4' Graph: 16 vertices and 163 arcs (0.03s) #V4/#V3 = 0.11 #A4/#A3 = 0.40 Ready! (0.03s) Optimize a model with 59 rows, 164 columns and 466 nonzeros Presolve removed 3 rows and 3 columns Presolve time: 0.00s Presolved: 56 rows, 161 columns, 459 nonzeros Variable types: 0 continuous, 161 integer (30 binary) Found heuristic solution: objective 109.0000000 Found heuristic solution: objective 106.0000000 Optimize a model with 56 rows, 161 columns and 459 nonzeros Presolved: 56 rows, 161 columns, 459 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.730e+02 Factor NZ : 6.350e+02 Factor Ops : 1.192e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 3.20575461e+02 -3.32464926e+02 6.63e+01 3.48e-02 4.55e+00 0s 1 7.41051062e+01 -1.33664502e+02 3.62e-13 3.33e-16 6.06e-01 0s 2 4.60714811e+01 2.58646518e+01 3.51e-14 2.22e-16 5.74e-02 0s 3 4.00531788e+01 3.96300985e+01 1.78e-14 3.33e-16 1.20e-03 0s 4 4.00000544e+01 3.99996313e+01 7.28e-14 2.60e-16 1.20e-06 0s 5 4.00000000e+01 4.00000000e+01 2.16e-13 2.22e-16 1.20e-12 0s Barrier solved model in 5 iterations and 0.00 seconds Optimal objective 4.00000000e+01 Root relaxation: objective 4.000000e+01, 128 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 (128 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: 1 x [18, 33, 43] 3 x [28, 37, 42] 6 x [6, 7, 41] 2 x [1, 5, 40] 2 x [2, 30, 39] 1 x [36, 38, 38] 3 x [24, 34, 35] 2 x [6, 13, 32] 1 x [14, 18, 31] 2 x [14, 17, 29] 1 x [12, 16, 27] 2 x [19, 21, 26] 4 x [17, 18, 25] 1 x [6, 11, 23] 3 x [15, 20, 22] 4 x [4, 9, 12] 1 x [1, 5, 10] 1 x [1, 3, 8]