Build (method = -2) #dp: 380 Step-3' Graph: 38 vertices and 122 arcs (0.00s) Step-4' Graph: 12 vertices and 70 arcs (0.00s) #V4/#V3 = 0.32 #A4/#A3 = 0.57 Ready! (0.00s) Optimize a model with 46 rows, 71 columns and 194 nonzeros Presolve removed 33 rows and 43 columns Presolve time: 0.00s Presolved: 13 rows, 28 columns, 70 nonzeros Variable types: 0 continuous, 28 integer (4 binary) Found heuristic solution: objective 37.0000000 Found heuristic solution: objective 29.0000000 Optimize a model with 13 rows, 28 columns and 70 nonzeros Presolved: 13 rows, 28 columns, 70 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 2.300e+01 Factor NZ : 9.100e+01 Factor Ops : 8.190e+02 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.58115724e+02 -1.47849780e+02 1.68e+01 2.22e-16 1.30e+01 0s 1 4.74835787e+01 -3.74530962e+01 7.38e-01 5.55e-16 1.57e+00 0s 2 3.52110100e+01 1.31280971e+01 4.62e-03 3.33e-15 3.51e-01 0s 3 2.89779943e+01 2.58599491e+01 5.11e-07 1.70e-16 4.95e-02 0s 4 2.85121892e+01 2.84587781e+01 6.74e-10 1.87e-16 8.48e-04 0s Barrier performed 4 iterations in 0.00 seconds Objective cutoff exceeded Root relaxation: cutoff, 0 iterations, 0.00 seconds Explored 0 nodes (0 simplex iterations) in 0.00 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 2.900000000000e+01, best bound 2.900000000000e+01, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.01 seconds Objective: 29 Solution: 1 x [34] 1 x [33] 1 x [32] 1 x [1, 31] 1 x [1, 30] 1 x [29] 1 x [28] 1 x [3, 27] 2 x [26] 1 x [2, 25] 2 x [5, 24] 2 x [12, 23] 1 x [13, 22] 1 x [9, 22] 1 x [4, 22] 1 x [15, 21] 1 x [16, 20] 1 x [19] 3 x [17, 18] 1 x [14, 14] 1 x [11, 12] 1 x [7, 11] 1 x [6, 10] 1 x [6, 8]