Build (method = -2) #dp: 12569 Step-3' Graph: 964 vertices and 4051 arcs (0.07s) Step-4' Graph: 904 vertices and 3931 arcs (0.07s) #V4/#V3 = 0.94 #A4/#A3 = 0.97 Ready! (0.07s) Optimize a model with 914 rows, 3932 columns and 10003 nonzeros Presolve removed 268 rows and 513 columns Presolve time: 0.06s Presolved: 646 rows, 3419 columns, 9305 nonzeros Variable types: 0 continuous, 3419 integer (0 binary) Found heuristic solution: objective 826.0000000 Optimize a model with 646 rows, 3419 columns and 9305 nonzeros Presolved: 646 rows, 3419 columns, 9305 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 5.272e+03 Factor NZ : 2.865e+04 (roughly 2 MBytes of memory) Factor Ops : 1.873e+06 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.10741838e+04 -6.70436299e+05 6.41e+05 2.22e-16 8.88e+02 0s 1 3.61696272e+03 -4.72230862e+05 1.25e+05 5.55e-16 2.11e+02 0s 2 1.86979429e+03 -1.88429487e+05 3.42e+04 8.88e-16 6.09e+01 0s 3 1.17620629e+03 -6.67905289e+04 6.65e+03 1.07e-14 1.60e+01 0s 4 1.04327791e+03 -3.68350742e+04 1.81e+03 2.31e-14 7.06e+00 0s 5 1.00892519e+03 -2.66825226e+04 5.26e+02 1.78e-14 4.44e+00 0s 6 9.93486604e+02 -6.99167828e+03 1.82e+01 5.77e-15 1.17e+00 0s 7 8.60431812e+02 -3.97121102e+03 2.96e-12 3.44e-15 7.06e-01 0s 8 5.03190664e+02 -1.76269607e+03 1.35e-12 1.78e-15 3.31e-01 0s 9 2.63090995e+02 -9.43965382e+02 6.32e-13 1.55e-15 1.76e-01 0s 10 1.46537248e+02 -3.74863935e+02 4.13e-13 5.65e-16 7.61e-02 0s 11 1.27263303e+02 -1.72088618e+02 5.26e-13 5.90e-16 4.37e-02 0s 12 1.03344461e+02 -6.58074866e+01 3.12e-13 6.57e-16 2.47e-02 0s 13 9.18554751e+01 -9.92110601e+00 1.44e-12 6.77e-16 1.49e-02 0s 14 9.14539566e+01 4.45021111e+01 1.24e-12 5.69e-16 6.86e-03 0s 15 8.41462135e+01 7.58611407e+01 5.02e-11 4.35e-16 1.21e-03 0s 16 8.33446460e+01 8.31800548e+01 3.12e-12 4.64e-16 2.40e-05 0s 17 8.33333446e+01 8.33331800e+01 6.74e-12 4.81e-16 2.40e-08 0s 18 8.33333333e+01 8.33333333e+01 1.03e-11 5.58e-16 2.48e-14 0s Barrier solved model in 18 iterations and 0.07 seconds Optimal objective 8.33333333e+01 Root relaxation: objective 8.333333e+01, 1977 iterations, 0.10 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 83.33333 0 47 826.00000 83.33333 89.9% - 0s H 0 0 85.0000000 83.33333 1.96% - 0s H 0 0 84.0000000 83.33333 0.79% - 0s Explored 0 nodes (4078 simplex iterations) in 0.41 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 8.400000000000e+01, best bound 8.400000000000e+01, gap 0.0% Preprocessing time: 0.09 seconds Gurobi run time: 0.41 seconds Total run time: 0.50 seconds Objective: 84 Solution: 15 x [1, 1, 2, 3, 3, 3, 5, 5, 7, 8, 9, 10] 1 x [2, 3, 4, 5, 8, 9, 9, 9, 10] 9 x [1, 1, 1, 2, 3, 3, 3, 5, 5, 8, 9, 10] 4 x [1, 1, 1, 5, 8, 9, 9, 9, 9, 9, 9, 10] 30 x [1, 1, 1, 2, 3, 5, 5, 5, 7, 7, 8, 9] 2 x [1, 1, 1, 1, 5, 7, 9, 9, 9, 9, 9, 9] 4 x [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 4, 6] 17 x [1, 1, 1, 4, 5, 6, 9, 9, 9, 9, 9, 9] 1 x [1, 1, 1, 1, 1, 1, 1, 4, 5, 6] 1 x [2, 2, 2, 2, 2, 2, 2, 2, 4]