Build (method = -2) #dp: 67 Step-3' Graph: 18 vertices and 47 arcs (0.00s) Step-4' Graph: 11 vertices and 33 arcs (0.00s) #V4/#V3 = 0.61 #A4/#A3 = 0.70 Ready! (0.00s) Optimize a model with 21 rows, 34 columns and 84 nonzeros Presolve removed 13 rows and 20 columns Presolve time: 0.00s Presolved: 8 rows, 14 columns, 34 nonzeros Variable types: 0 continuous, 14 integer (0 binary) Found heuristic solution: objective 74.0000000 Optimize a model with 8 rows, 14 columns and 34 nonzeros Presolved: 8 rows, 14 columns, 34 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.800e+01 Factor NZ : 3.600e+01 Factor Ops : 2.040e+02 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 8.70558542e+01 -6.10826429e+01 1.12e+01 1.11e-16 6.81e+00 0s 1 7.29712787e+01 4.32181287e+01 1.09e-02 3.33e-16 9.72e-01 0s 2 6.32538992e+01 6.01031042e+01 5.12e-04 3.33e-16 1.02e-01 0s 3 6.20397235e+01 6.19708379e+01 5.11e-06 6.42e-17 2.22e-03 0s 4 6.20000403e+01 6.19999714e+01 1.78e-15 1.11e-16 2.22e-06 0s 5 6.20000000e+01 6.20000000e+01 5.33e-15 3.33e-16 2.22e-12 0s Barrier solved model in 5 iterations and 0.00 seconds Optimal objective 6.20000000e+01 Root relaxation: objective 6.200000e+01, 5 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 62.0000000 62.00000 0.0% - 0s Explored 0 nodes (5 simplex iterations) in 0.00 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 6.200000000000e+01, best bound 6.200000000000e+01, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.01 seconds Objective: 62 Solution: 1 x [1] 9 x [1, 10] 14 x [2] 14 x [3] 1 x [3, 9] 2 x [4, 7] 10 x [4, 8] 2 x [5, 6] 4 x [5, 7] 5 x [6, 7, 8]