Build (method = -2) #dp: 59 Step-3' Graph: 18 vertices and 47 arcs (0.00s) Step-4' Graph: 10 vertices and 31 arcs (0.00s) #V4/#V3 = 0.56 #A4/#A3 = 0.66 Ready! (0.00s) Optimize a model with 20 rows, 32 columns and 80 nonzeros Presolve removed 9 rows and 10 columns Presolve time: 0.00s Presolved: 11 rows, 22 columns, 54 nonzeros Variable types: 0 continuous, 22 integer (0 binary) Found heuristic solution: objective 80.0000000 Found heuristic solution: objective 64.0000000 Optimize a model with 11 rows, 22 columns and 54 nonzeros Presolved: 11 rows, 22 columns, 54 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 2.600e+01 Factor NZ : 6.600e+01 Factor Ops : 5.060e+02 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.66080449e+02 -2.15197896e+02 9.14e+01 1.11e-16 1.63e+01 0s 1 9.15569910e+01 -4.17335864e+00 2.70e+00 1.11e-16 2.12e+00 0s 2 7.23862439e+01 3.84196331e+01 1.59e-01 2.22e-16 7.11e-01 0s 3 6.58761033e+01 6.17751502e+01 4.71e-06 2.22e-16 8.54e-02 0s 4 6.42002974e+01 6.35576019e+01 7.47e-07 2.22e-16 1.34e-02 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 6.400000000000e+01, best bound 6.400000000000e+01, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.01 seconds Objective: 64 Solution: 10 x [1, 8] 8 x [1, 9] 20 x [2] 2 x [2, 10] 1 x [3] 3 x [3, 7] 6 x [4] 13 x [5, 6] 1 x [6]