Build (method = -2) #dp: 79 Step-3' Graph: 21 vertices and 56 arcs (0.00s) Step-4' Graph: 12 vertices and 38 arcs (0.00s) #V4/#V3 = 0.57 #A4/#A3 = 0.68 Ready! (0.00s) Optimize a model with 22 rows, 39 columns and 97 nonzeros Presolve removed 9 rows and 12 columns Presolve time: 0.00s Presolved: 13 rows, 27 columns, 66 nonzeros Variable types: 0 continuous, 27 integer (0 binary) Found heuristic solution: objective 84.0000000 Found heuristic solution: objective 67.0000000 Optimize a model with 13 rows, 27 columns and 66 nonzeros Presolved: 13 rows, 27 columns, 66 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 3.400e+01 Factor NZ : 9.100e+01 Factor Ops : 8.190e+02 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.30884344e+02 -1.39947882e+02 7.71e+01 2.22e-16 9.89e+00 0s 1 8.05893364e+01 4.89266531e+00 1.42e-14 2.22e-16 1.31e+00 0s 2 6.64810231e+01 5.75227822e+01 7.11e-15 1.39e-16 1.55e-01 0s 3 6.36569180e+01 6.28499106e+01 2.84e-14 1.11e-16 1.39e-02 0s 4 6.35005078e+01 6.34989820e+01 2.31e-14 1.16e-16 2.63e-05 0s 5 6.35000000e+01 6.35000000e+01 5.68e-14 1.73e-16 2.67e-11 0s Barrier solved model in 5 iterations and 0.00 seconds Optimal objective 6.35000000e+01 Root relaxation: objective 6.350000e+01, 12 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 63.50000 0 3 67.00000 63.50000 5.22% - 0s H 0 0 64.0000000 63.50000 0.78% - 0s Explored 0 nodes (14 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: 13 x [1] 10 x [2] 2 x [2, 8] 5 x [2, 9] 4 x [3] 3 x [3, 10] 5 x [4, 7] 9 x [5, 6] 8 x [5, 7] 4 x [6, 7] 1 x [7]