Build (method = -2) #dp: 2584 Step-3' Graph: 194 vertices and 681 arcs (0.01s) Step-4' Graph: 140 vertices and 573 arcs (0.01s) #V4/#V3 = 0.72 #A4/#A3 = 0.84 Ready! (0.01s) Optimize a model with 150 rows, 574 columns and 1453 nonzeros Presolve removed 43 rows and 75 columns Presolve time: 0.01s Presolved: 107 rows, 499 columns, 1360 nonzeros Variable types: 0 continuous, 499 integer (73 binary) Found heuristic solution: objective 95.0000000 Optimize a model with 107 rows, 499 columns and 1360 nonzeros Presolved: 107 rows, 499 columns, 1360 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 7.920e+02 Factor NZ : 2.381e+03 Factor Ops : 5.993e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.49673308e+03 -8.13522785e+03 9.80e+03 1.48e-01 6.05e+01 0s 1 3.66358575e+02 -4.33478050e+03 1.75e+03 5.55e-16 1.23e+01 0s 2 1.64156807e+02 -1.32502401e+03 2.50e+02 1.07e-15 2.29e+00 0s 3 9.49749479e+01 -2.06772247e+02 2.66e+01 5.55e-16 3.56e-01 0s 4 5.06668065e+01 -8.55642099e+01 6.17e+00 4.44e-16 1.46e-01 0s 5 4.40219699e+01 -3.29439550e+01 5.23e+00 4.32e-16 8.38e-02 0s 6 2.62090751e+01 -9.45717016e+00 2.78e+00 3.24e-16 3.89e-02 0s 7 1.58152846e+01 -3.25712000e-01 1.33e+00 4.25e-16 1.75e-02 0s 8 1.56623901e+01 7.21692158e+00 6.59e-01 5.41e-16 8.87e-03 0s 9 1.31054649e+01 1.12620446e+01 5.12e-02 3.36e-16 1.85e-03 0s 10 1.25033557e+01 1.24859747e+01 6.16e-14 5.34e-16 1.73e-05 0s 11 1.25000034e+01 1.24999860e+01 3.92e-14 6.04e-16 1.73e-08 0s 12 1.25000000e+01 1.25000000e+01 7.86e-14 3.66e-16 1.73e-11 0s Barrier solved model in 12 iterations and 0.01 seconds Optimal objective 1.25000000e+01 Root relaxation: objective 1.250000e+01, 277 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 12.50000 0 32 95.00000 12.50000 86.8% - 0s H 0 0 15.0000000 12.50000 16.7% - 0s H 0 0 14.0000000 12.50000 10.7% - 0s H 0 0 13.0000000 12.50000 3.85% - 0s Explored 0 nodes (525 simplex iterations) in 0.04 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.300000000000e+01, best bound 1.300000000000e+01, gap 0.0% Preprocessing time: 0.02 seconds Gurobi run time: 0.04 seconds Total run time: 0.06 seconds Objective: 13 Solution: 2 x [5, 6, 6, 7, 8, 9, 9, 9] 1 x [1, 6, 7, 7, 8, 9] 1 x [3, 3, 3, 3, 4, 5, 10, 10] 5 x [3, 3, 4, 5, 7, 10, 10, 10] 1 x [3, 3, 3, 5, 10, 10, 10, 10] 2 x [3, 3, 3, 5, 5, 5, 5, 6] 1 x [2, 6, 6, 10, 10, 10]