Build (method = -2) #dp: 63 Step-3' Graph: 17 vertices and 44 arcs (0.00s) Step-4' Graph: 11 vertices and 32 arcs (0.00s) #V4/#V3 = 0.65 #A4/#A3 = 0.73 Ready! (0.00s) Optimize a model with 21 rows, 33 columns and 81 nonzeros Presolve removed 10 rows and 12 columns Presolve time: 0.00s Presolved: 11 rows, 21 columns, 50 nonzeros Variable types: 0 continuous, 21 integer (0 binary) Found heuristic solution: objective 81.0000000 Found heuristic solution: objective 80.0000000 Found heuristic solution: objective 71.0000000 Optimize a model with 11 rows, 21 columns and 50 nonzeros Presolved: 11 rows, 21 columns, 50 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 2.500e+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.42618110e+02 -1.93432662e+02 1.37e+02 2.22e-16 1.65e+01 0s 1 8.23395128e+01 5.11724512e+00 2.31e-14 2.22e-16 1.72e+00 0s 2 7.54858129e+01 6.09249223e+01 1.42e-14 5.55e-16 3.24e-01 0s 3 7.11112711e+01 7.05087139e+01 7.11e-15 4.44e-16 1.34e-02 0s Barrier performed 3 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 7.100000000000e+01, best bound 7.100000000000e+01, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.01 seconds Objective: 71 Solution: 10 x [1] 3 x [1, 8, 10] 2 x [2, 8] 1 x [2, 8, 10] 10 x [2, 9] 12 x [3] 5 x [3, 7] 17 x [4] 7 x [5] 4 x [5, 6]