Build (method = -2) #dp: 79 Step-3' Graph: 17 vertices and 51 arcs (0.00s) Step-4' Graph: 12 vertices and 41 arcs (0.00s) #V4/#V3 = 0.71 #A4/#A3 = 0.80 Ready! (0.00s) Optimize a model with 22 rows, 42 columns and 110 nonzeros Presolve removed 8 rows and 8 columns Presolve time: 0.00s Presolved: 14 rows, 34 columns, 88 nonzeros Variable types: 0 continuous, 34 integer (0 binary) Found heuristic solution: objective 83.0000000 Found heuristic solution: objective 82.0000000 Found heuristic solution: objective 76.0000000 Optimize a model with 14 rows, 34 columns and 88 nonzeros Presolved: 14 rows, 34 columns, 88 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 4.400e+01 Factor NZ : 1.050e+02 Factor Ops : 1.015e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.42703242e+02 -2.01301107e+02 1.60e+02 1.11e-16 1.07e+01 0s 1 8.18597956e+01 -1.52811210e+01 1.24e-14 1.94e-16 1.36e+00 0s 2 6.30635347e+01 4.66260206e+01 1.42e-14 1.45e-16 2.29e-01 0s 3 5.92204577e+01 5.84567461e+01 5.33e-15 2.58e-16 1.06e-02 0s 4 5.90002313e+01 5.89994619e+01 6.04e-14 3.33e-16 1.07e-05 0s 5 5.90000000e+01 5.90000000e+01 5.68e-14 2.22e-16 1.07e-11 0s Barrier solved model in 5 iterations and 0.00 seconds Optimal objective 5.90000000e+01 Root relaxation: objective 5.900000e+01, 20 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 59.0000000 59.00000 0.0% - 0s Explored 0 nodes (20 simplex iterations) in 0.00 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 5.900000000000e+01, best bound 5.900000000000e+01, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.01 seconds Objective: 59 Solution: 4 x [5] 5 x [4] 7 x [3, 4] 3 x [7] 1 x [2, 7] 1 x [7, 8] 3 x [7, 8, 8] 10 x [1, 9] 9 x [6] 1 x [2, 6] 15 x [2, 10]