Build (method = -2) #dp: 139 Step-3' Graph: 26 vertices and 85 arcs (0.00s) Step-4' Graph: 19 vertices and 71 arcs (0.00s) #V4/#V3 = 0.73 #A4/#A3 = 0.84 Ready! (0.00s) Optimize a model with 29 rows, 72 columns and 188 nonzeros Presolve removed 7 rows and 8 columns Presolve time: 0.00s Presolved: 22 rows, 64 columns, 168 nonzeros Variable types: 0 continuous, 64 integer (0 binary) Found heuristic solution: objective 70.0000000 Found heuristic solution: objective 68.0000000 Optimize a model with 22 rows, 64 columns and 168 nonzeros Presolved: 22 rows, 64 columns, 168 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 9.500e+01 Factor NZ : 2.530e+02 Factor Ops : 3.795e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 2.20070271e+02 -5.10142459e+02 3.00e+02 2.22e-16 1.63e+01 0s 1 9.57612914e+01 -1.55646614e+02 8.01e+00 5.55e-16 2.06e+00 0s 2 7.21198718e+01 -8.76250460e+00 7.17e-02 1.25e-15 6.05e-01 0s 3 6.17881163e+01 2.25154030e+01 1.73e-02 4.58e-16 2.93e-01 0s 4 5.21013605e+01 4.36208106e+01 6.96e-04 2.22e-16 6.33e-02 0s 5 5.06808746e+01 4.93488503e+01 1.34e-04 2.22e-16 9.94e-03 0s 6 5.05009599e+01 5.04975609e+01 1.07e-14 2.22e-16 2.54e-05 0s 7 5.05000000e+01 5.05000000e+01 5.68e-14 3.20e-16 2.75e-11 0s Barrier solved model in 7 iterations and 0.00 seconds Optimal objective 5.05000000e+01 Root relaxation: objective 5.050000e+01, 26 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 50.50000 0 2 68.00000 50.50000 25.7% - 0s H 0 0 51.0000000 50.50000 0.98% - 0s Explored 0 nodes (28 simplex iterations) in 0.00 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 5.100000000000e+01, best bound 5.100000000000e+01, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.01 seconds Objective: 51 Solution: 3 x [7] 10 x [6, 7] 9 x [1, 4] 2 x [1, 2] 1 x [1, 10] 2 x [1, 10, 10, 10] 9 x [5, 9] 2 x [3] 2 x [3, 9] 4 x [3, 6] 1 x [8] 6 x [8, 8]