Build (method = -2) #dp: 292 Step-3' Graph: 54 vertices and 168 arcs (0.00s) Step-4' Graph: 24 vertices and 108 arcs (0.00s) #V4/#V3 = 0.44 #A4/#A3 = 0.64 Ready! (0.00s) Optimize a model with 32 rows, 109 columns and 287 nonzeros Presolve removed 3 rows and 4 columns Presolve time: 0.00s Presolved: 29 rows, 105 columns, 279 nonzeros Variable types: 0 continuous, 105 integer (0 binary) Found heuristic solution: objective 278.0000000 Found heuristic solution: objective 226.0000000 Optimize a model with 29 rows, 105 columns and 279 nonzeros Presolved: 29 rows, 105 columns, 279 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.410e+02 Factor NZ : 3.550e+02 Factor Ops : 5.275e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.94590899e+03 -5.64677482e+03 5.10e+03 1.11e-16 1.39e+02 0s 1 5.63101091e+02 -2.12576066e+03 7.70e+02 5.00e-16 2.45e+01 0s 2 2.02560591e+02 -3.69321682e+02 4.14e+01 8.88e-16 3.07e+00 0s 3 1.29610676e+02 -4.75431039e+01 1.83e+01 2.22e-16 8.93e-01 0s 4 8.36288070e+01 -1.67365911e+00 4.74e+00 2.14e-16 4.06e-01 0s 5 6.72743464e+01 3.10144442e+01 9.67e-01 1.56e-16 1.68e-01 0s 6 5.90187816e+01 4.99380425e+01 2.84e-01 1.35e-16 4.20e-02 0s 7 5.62014035e+01 5.37286761e+01 4.07e-02 1.14e-16 1.14e-02 0s 8 5.58237606e+01 5.57679537e+01 5.97e-13 3.33e-16 2.56e-04 0s 9 5.58000007e+01 5.57999952e+01 1.21e-13 2.22e-16 2.53e-08 0s 10 5.58000000e+01 5.58000000e+01 3.45e-13 1.48e-16 2.53e-11 0s Barrier solved model in 10 iterations and 0.00 seconds Optimal objective 5.58000000e+01 Root relaxation: objective 5.580000e+01, 49 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 55.80000 0 5 226.00000 55.80000 75.3% - 0s H 0 0 56.0000000 55.80000 0.36% - 0s Explored 0 nodes (51 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: 1 x [1, 2, 5, 8] 8 x [1, 2, 2, 2, 8] 21 x [1, 2, 2, 2, 5] 1 x [2, 3, 4, 5, 8] 5 x [2, 3, 4, 4, 4] 4 x [2, 2, 2, 2, 7] 16 x [2, 2, 2, 6, 6]