Build (method = -2) #dp: 379 Step-3' Graph: 36 vertices and 122 arcs (0.00s) Step-4' Graph: 12 vertices and 74 arcs (0.00s) #V4/#V3 = 0.33 #A4/#A3 = 0.61 Ready! (0.00s) Optimize a model with 52 rows, 75 columns and 206 nonzeros Presolve removed 40 rows and 47 columns Presolve time: 0.00s Presolved: 12 rows, 28 columns, 69 nonzeros Variable types: 0 continuous, 28 integer (5 binary) Found heuristic solution: objective 36.0000000 Found heuristic solution: objective 31.0000000 Optimize a model with 12 rows, 28 columns and 69 nonzeros Presolved: 12 rows, 28 columns, 69 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 2.100e+01 Factor NZ : 7.800e+01 Factor Ops : 6.500e+02 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.20591811e+02 -8.12686545e+01 1.57e+01 2.22e-16 7.06e+00 0s 1 4.27971748e+01 -2.60420605e+00 3.46e-01 4.83e-15 8.04e-01 0s 2 3.44085468e+01 2.02509556e+01 1.57e-02 3.66e-15 2.36e-01 0s 3 3.08644017e+01 2.90554899e+01 6.32e-04 3.89e-15 3.01e-02 0s 4 3.05251574e+01 3.04545542e+01 8.80e-06 8.53e-16 1.18e-03 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 3.100000000000e+01, best bound 3.100000000000e+01, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.01 seconds Objective: 31 Solution: 1 x [40] 1 x [39] 1 x [38] 1 x [37] 1 x [36] 3 x [35] 1 x [34] 2 x [33] 1 x [1, 32] 1 x [1, 31] 1 x [2, 30] 1 x [5, 29] 1 x [7, 28] 1 x [6, 27] 1 x [11, 26] 1 x [10, 25] 1 x [12, 24] 1 x [9, 23] 2 x [7, 22] 1 x [8, 21] 1 x [14, 20] 1 x [15, 19] 1 x [16, 18] 1 x [13, 17] 1 x [13, 14] 1 x [3, 4] 1 x [3]