Build (method = -2) #dp: 86 Step-3' Graph: 24 vertices and 65 arcs (0.00s) Step-4' Graph: 13 vertices and 43 arcs (0.00s) #V4/#V3 = 0.54 #A4/#A3 = 0.66 Ready! (0.00s) Optimize a model with 23 rows, 44 columns and 110 nonzeros Presolve removed 9 rows and 12 columns Presolve time: 0.00s Presolved: 14 rows, 32 columns, 82 nonzeros Variable types: 0 continuous, 32 integer (0 binary) Found heuristic solution: objective 51.0000000 Optimize a model with 14 rows, 32 columns and 82 nonzeros Presolved: 14 rows, 32 columns, 82 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 4.600e+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.94025820e+02 -2.93500737e+02 1.71e+02 1.11e-16 2.11e+01 0s 1 8.14585766e+01 -8.99025775e+01 1.62e+01 3.33e-16 3.35e+00 0s 2 5.29110101e+01 7.53953390e+00 9.48e-01 5.55e-15 6.75e-01 0s 3 4.07474550e+01 3.34591084e+01 7.15e-04 5.55e-16 1.06e-01 0s 4 3.83573909e+01 3.75542225e+01 1.29e-04 3.50e-16 1.16e-02 0s 5 3.80029391e+01 3.79968882e+01 3.24e-07 3.10e-16 8.77e-05 0s 6 3.80000000e+01 3.80000000e+01 4.03e-13 6.97e-16 1.06e-10 0s Barrier solved model in 6 iterations and 0.00 seconds Optimal objective 3.80000000e+01 Root relaxation: objective 3.800000e+01, 9 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 38.0000000 38.00000 0.0% - 0s Explored 0 nodes (9 simplex iterations) in 0.00 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 3.800000000000e+01, best bound 3.800000000000e+01, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.01 seconds Objective: 38 Solution: 4 x [1, 8] 11 x [2, 9, 10] 3 x [3, 5] 6 x [3, 6] 1 x [3, 8] 1 x [3, 9, 10] 6 x [4, 5, 10] 2 x [4, 7, 10] 4 x [5, 8, 9]