Build (method = -2) #dp: 91 Step-3' Graph: 20 vertices and 64 arcs (0.00s) Step-4' Graph: 11 vertices and 46 arcs (0.00s) #V4/#V3 = 0.55 #A4/#A3 = 0.72 Ready! (0.00s) Optimize a model with 21 rows, 47 columns and 123 nonzeros Presolve removed 8 rows and 13 columns Presolve time: 0.00s Presolved: 13 rows, 34 columns, 90 nonzeros Variable types: 0 continuous, 34 integer (0 binary) Found heuristic solution: objective 95.0000000 Optimize a model with 13 rows, 34 columns and 90 nonzeros Presolved: 13 rows, 34 columns, 90 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 3.800e+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 2.05631760e+02 -3.71048785e+02 2.48e+02 2.22e-16 1.92e+01 0s 1 8.59509623e+01 -1.03252428e+02 2.05e+00 4.44e-16 2.66e+00 0s 2 6.23586892e+01 1.92254412e+01 1.73e-02 2.22e-16 5.91e-01 0s 3 5.25662602e+01 4.56411373e+01 8.67e-05 3.33e-16 9.49e-02 0s 4 5.01805317e+01 4.93402568e+01 6.28e-06 2.22e-16 1.15e-02 0s 5 5.00117850e+01 4.99937610e+01 1.12e-07 2.22e-16 2.47e-04 0s 6 5.00000001e+01 4.99999998e+01 3.30e-12 2.05e-16 4.78e-09 0s 7 5.00000000e+01 5.00000000e+01 7.11e-14 2.22e-16 4.82e-15 0s Barrier solved model in 7 iterations and 0.00 seconds Optimal objective 5.00000000e+01 Root relaxation: objective 5.000000e+01, 10 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 50.0000000 50.00000 0.0% - 0s Explored 0 nodes (10 simplex iterations) in 0.00 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 5.000000000000e+01, best bound 5.000000000000e+01, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.01 seconds Objective: 50 Solution: 13 x [1] 3 x [1, 10] 1 x [1, 8] 8 x [4, 6] 1 x [6, 7] 8 x [3, 6] 3 x [7, 9] 6 x [2, 3, 5] 2 x [3, 5, 5] 5 x [2, 2, 5]