Build (method = -2) #dp: 91 Step-3' Graph: 14 vertices and 47 arcs (0.00s) Step-4' Graph: 10 vertices and 39 arcs (0.00s) #V4/#V3 = 0.71 #A4/#A3 = 0.83 Ready! (0.00s) Optimize a model with 20 rows, 40 columns and 108 nonzeros Presolve removed 13 rows and 23 columns Presolve time: 0.00s Presolved: 7 rows, 17 columns, 29 nonzeros Variable types: 0 continuous, 17 integer (0 binary) Found heuristic solution: objective 88.0000000 Optimize a model with 7 rows, 17 columns and 29 nonzeros Presolve removed 3 rows and 7 columns Presolved: 4 rows, 10 columns, 16 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 4.000e+00 Factor NZ : 1.000e+01 Factor Ops : 3.000e+01 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 7.96875000e+01 -7.70661454e+00 9.54e-01 2.22e-16 5.56e+00 0s 1 6.39658042e+01 4.99175606e+01 0.00e+00 4.44e-16 5.97e-01 0s 2 5.77513477e+01 5.61742498e+01 0.00e+00 2.22e-16 6.57e-02 0s 3 5.75108462e+01 5.74977421e+01 0.00e+00 1.11e-16 5.46e-04 0s 4 5.75000109e+01 5.74999978e+01 0.00e+00 1.11e-16 5.46e-07 0s 5 5.75000000e+01 5.75000000e+01 0.00e+00 1.11e-16 5.46e-13 0s Barrier solved model in 5 iterations and 0.00 seconds Optimal objective 5.75000000e+01 Root relaxation: objective 5.750000e+01, 7 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 57.50000 0 2 88.00000 57.50000 34.7% - 0s H 0 0 58.0000000 57.50000 0.86% - 0s Explored 0 nodes (7 simplex iterations) in 0.00 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 5.800000000000e+01, best bound 5.800000000000e+01, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.01 seconds Objective: 58 Solution: 5 x [8] 3 x [9] 7 x [1] 3 x [1, 5] 9 x [1, 6] 14 x [3, 10] 9 x [4, 7] 4 x [4, 4] 1 x [2, 10] 2 x [2, 2] 1 x [10]