Build (method = -2) #dp: 4119 Step-3' Graph: 345 vertices and 1240 arcs (0.02s) Step-4' Graph: 259 vertices and 1068 arcs (0.02s) #V4/#V3 = 0.75 #A4/#A3 = 0.86 Ready! (0.02s) Optimize a model with 267 rows, 1069 columns and 2704 nonzeros Presolve removed 73 rows and 138 columns Presolve time: 0.02s Presolved: 194 rows, 931 columns, 2486 nonzeros Variable types: 0 continuous, 931 integer (158 binary) Found heuristic solution: objective 72.0000000 Optimize a model with 194 rows, 931 columns and 2486 nonzeros Presolve removed 2 rows and 2 columns Presolved: 192 rows, 929 columns, 2486 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.448e+03 Factor NZ : 5.329e+03 Factor Ops : 1.924e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 7.02965139e+02 -1.44027597e+04 1.37e+04 5.73e-02 5.07e+01 0s 1 2.55674400e+02 -8.40139445e+03 2.88e+03 2.78e-15 1.24e+01 0s 2 1.56426923e+02 -2.76576844e+03 6.06e+02 1.78e-15 2.84e+00 0s 3 1.26407567e+02 -5.73242557e+02 7.81e+01 2.64e-15 4.98e-01 0s 4 9.98361614e+01 -1.13624116e+02 2.51e+01 1.95e-15 1.34e-01 0s 5 9.45943557e+01 -1.15788349e+02 2.19e+01 2.74e-15 1.31e-01 0s 6 6.13528611e+01 -8.44910331e+01 1.38e+01 3.38e-15 8.92e-02 0s 7 5.43146671e+01 -4.94726411e+01 1.18e+01 2.31e-15 6.42e-02 0s 8 2.24857071e+01 -1.17877900e+01 3.93e+00 2.33e-15 2.11e-02 0s 9 1.73247663e+01 -4.70895610e+00 2.87e+00 2.13e-15 1.37e-02 0s 10 1.38070147e+01 2.08348697e+00 1.85e+00 2.00e-15 7.34e-03 0s 11 1.10870539e+01 4.39933601e+00 1.05e+00 2.02e-15 4.08e-03 0s 12 9.39171939e+00 5.41292483e+00 5.91e-01 2.29e-15 2.37e-03 0s 13 9.47033904e+00 5.63310262e+00 5.74e-01 3.13e-15 2.28e-03 0s 14 9.27178548e+00 6.67361774e+00 3.39e-01 2.64e-15 1.50e-03 0s 15 8.70449808e+00 7.87403411e+00 1.04e-01 2.17e-15 4.68e-04 0s 16 8.37050368e+00 8.18798195e+00 1.18e-02 2.38e-15 1.00e-04 0s 17 8.33492630e+00 8.32276457e+00 2.15e-04 1.77e-15 6.58e-06 0s 18 8.33333715e+00 8.33332202e+00 4.97e-09 2.54e-15 8.11e-09 0s 19 8.33333333e+00 8.33333333e+00 2.05e-11 1.67e-15 8.13e-15 0s Barrier solved model in 19 iterations and 0.02 seconds Optimal objective 8.33333333e+00 Root relaxation: objective 8.333333e+00, 455 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 8.33333 0 41 72.00000 8.33333 88.4% - 0s H 0 0 13.0000000 8.33333 35.9% - 0s H 0 0 9.0000000 8.33333 7.41% - 0s Explored 0 nodes (630 simplex iterations) in 0.07 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 9.000000000000e+00, best bound 9.000000000000e+00, gap 0.0% Preprocessing time: 0.03 seconds Gurobi run time: 0.07 seconds Total run time: 0.10 seconds Objective: 9 Solution: 1 x [1, 2, 2, 2, 3, 4, 5, 7, 7, 7] 1 x [1, 1, 2, 2, 3, 6, 6, 6, 6] 3 x [2, 3, 3, 4, 5, 6, 6, 6, 7, 7, 7, 7] 1 x [2, 3, 3, 4, 4, 5, 6, 6, 7, 8] 1 x [2, 3, 3, 3, 4, 4, 5, 5, 5, 5, 5, 5] 1 x [2, 2, 2, 2, 2, 2, 2, 4, 4, 4, 4, 6] 1 x [4, 4, 4, 4, 6, 6, 6, 6, 6, 6, 6]