Build (method = -2) #dp: 277 Step-3' Graph: 33 vertices and 107 arcs (0.00s) Step-4' Graph: 12 vertices and 65 arcs (0.00s) #V4/#V3 = 0.36 #A4/#A3 = 0.61 Ready! (0.00s) Optimize a model with 45 rows, 66 columns and 179 nonzeros Presolve removed 29 rows and 30 columns Presolve time: 0.00s Presolved: 16 rows, 36 columns, 90 nonzeros Variable types: 0 continuous, 36 integer (6 binary) Found heuristic solution: objective 40.0000000 Found heuristic solution: objective 37.0000000 Found heuristic solution: objective 30.0000000 Optimize a model with 16 rows, 36 columns and 90 nonzeros Presolved: 16 rows, 36 columns, 90 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 2.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.52480310e+02 -1.02607257e+02 1.54e+01 1.11e-16 7.55e+00 0s 1 5.05549176e+01 -5.64932908e+00 1.13e+00 4.44e-16 9.07e-01 0s 2 3.62528822e+01 1.88047059e+01 3.49e-02 2.78e-15 2.25e-01 0s 3 3.14238455e+01 2.71400409e+01 9.25e-05 6.66e-16 5.49e-02 0s 4 3.00693471e+01 2.96386939e+01 1.88e-06 3.33e-16 5.52e-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.000000000000e+01, best bound 3.000000000000e+01, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.01 seconds Objective: 30 Solution: 1 x [33] 1 x [32] 1 x [31] 1 x [30] 2 x [29] 1 x [28] 1 x [1, 27] 1 x [1, 26] 1 x [4, 25] 1 x [3, 25] 1 x [2, 25] 3 x [24] 1 x [1, 24] 1 x [6, 23] 1 x [7, 22] 1 x [5, 22] 1 x [8, 21] 1 x [10, 20] 1 x [11, 19] 1 x [10, 18] 2 x [13, 17] 1 x [14, 16] 1 x [12, 16] 1 x [9, 15] 1 x [8, 8] 1 x [5, 6]