Build (method = -2) #dp: 80 Step-3' Graph: 14 vertices and 48 arcs (0.00s) Step-4' Graph: 10 vertices and 40 arcs (0.00s) #V4/#V3 = 0.71 #A4/#A3 = 0.83 Ready! (0.00s) Optimize a model with 20 rows, 41 columns and 109 nonzeros Presolve removed 6 rows and 8 columns Presolve time: 0.00s Presolved: 14 rows, 33 columns, 89 nonzeros Variable types: 0 continuous, 33 integer (0 binary) Found heuristic solution: objective 95.0000000 Found heuristic solution: objective 80.0000000 Optimize a model with 14 rows, 33 columns and 89 nonzeros Presolved: 14 rows, 33 columns, 89 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 4.000e+01 Factor NZ : 1.050e+02 Factor Ops : 1.015e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.67184764e+02 -2.59678617e+02 1.05e+02 1.11e-16 1.13e+01 0s 1 8.64097722e+01 -3.40673486e+01 2.13e-14 2.22e-16 1.69e+00 0s 2 6.44466504e+01 3.44434599e+01 3.55e-15 1.39e-16 4.18e-01 0s 3 5.55506790e+01 5.31290037e+01 1.42e-14 9.02e-17 3.36e-02 0s 4 5.52522728e+01 5.52430384e+01 1.42e-14 1.11e-16 1.28e-04 0s 5 5.52500000e+01 5.52500000e+01 2.84e-14 1.15e-16 2.04e-10 0s Barrier solved model in 5 iterations and 0.00 seconds Optimal objective 5.52500000e+01 Root relaxation: objective 5.525000e+01, 14 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 55.25000 0 6 80.00000 55.25000 30.9% - 0s H 0 0 56.0000000 55.25000 1.34% - 0s Explored 0 nodes (18 simplex iterations) in 0.00 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 5.600000000000e+01, best bound 5.600000000000e+01, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.01 seconds Objective: 56 Solution: 17 x [9] 10 x [1, 3] 6 x [1, 8] 3 x [6, 8] 7 x [5, 10] 4 x [2, 4] 1 x [2, 10] 3 x [2, 3, 8] 3 x [2, 7, 8] 1 x [2, 2] 1 x [3]