Build (method = -2) #dp: 210 Step-3' Graph: 21 vertices and 86 arcs (0.00s) Step-4' Graph: 13 vertices and 70 arcs (0.00s) #V4/#V3 = 0.62 #A4/#A3 = 0.81 Ready! (0.00s) Optimize a model with 47 rows, 71 columns and 191 nonzeros Presolve removed 29 rows and 31 columns Presolve time: 0.00s Presolved: 18 rows, 40 columns, 100 nonzeros Variable types: 0 continuous, 40 integer (8 binary) Found heuristic solution: objective 43.0000000 Found heuristic solution: objective 42.0000000 Found heuristic solution: objective 35.0000000 Optimize a model with 18 rows, 40 columns and 100 nonzeros Presolve removed 2 rows and 3 columns Presolved: 16 rows, 37 columns, 94 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 3.900e+01 Factor NZ : 1.360e+02 Factor Ops : 1.496e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.16391121e+02 -7.33375707e+01 2.62e+01 8.03e-02 6.41e+00 0s 1 4.70977039e+01 -2.32355553e+00 1.26e+00 2.78e-16 7.55e-01 0s 2 3.94329930e+01 2.48892756e+01 9.28e-03 1.67e-14 1.84e-01 0s 3 3.54177665e+01 3.14288951e+01 7.06e-05 4.22e-15 5.05e-02 0s 4 3.43734166e+01 3.40256550e+01 4.68e-06 2.22e-16 4.40e-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.500000000000e+01, best bound 3.500000000000e+01, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.01 seconds Objective: 35 Solution: 1 x [34] 1 x [33] 1 x [32] 1 x [31] 1 x [30] 2 x [29] 2 x [28] 1 x [27] 3 x [26] 2 x [25] 1 x [24] 1 x [23] 1 x [22] 1 x [21] 1 x [1, 20] 1 x [4, 19] 2 x [5, 18] 2 x [2, 17] 1 x [6, 16] 2 x [7, 15] 1 x [9, 14] 1 x [8, 14] 1 x [3, 13] 1 x [10, 12] 1 x [11, 11] 1 x [10] 1 x [6, 6]