Build (method = -2) #dp: 12911 Step-3' Graph: 692 vertices and 2649 arcs (0.07s) Step-4' Graph: 607 vertices and 2480 arcs (0.07s) #V4/#V3 = 0.88 #A4/#A3 = 0.94 Ready! (0.07s) Optimize a model with 617 rows, 2481 columns and 6243 nonzeros Presolve removed 211 rows and 397 columns Presolve time: 0.04s Presolved: 406 rows, 2084 columns, 5696 nonzeros Variable types: 0 continuous, 2084 integer (161 binary) Found heuristic solution: objective 100.0000000 Optimize a model with 406 rows, 2084 columns and 5696 nonzeros Presolved: 406 rows, 2084 columns, 5696 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 3.184e+03 Factor NZ : 1.292e+04 (roughly 1 MByte of memory) Factor Ops : 4.942e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.27418558e+03 -3.87444248e+04 5.01e+04 4.39e-02 8.91e+01 0s 1 3.45943711e+02 -2.48781187e+04 6.83e+03 8.88e-16 1.57e+01 0s 2 1.93920240e+02 -8.26743533e+03 1.77e+03 1.78e-15 4.02e+00 0s 3 1.46555604e+02 -2.55006035e+03 2.91e+02 4.88e-15 9.35e-01 0s 4 1.01470867e+02 -8.50862430e+02 7.40e+01 6.00e-15 2.90e-01 0s 5 9.95059667e+01 -2.46551995e+02 2.02e+01 2.66e-15 9.29e-02 0s 6 9.63497653e+01 -1.99408270e+02 8.14e+00 2.55e-15 7.44e-02 0s 7 7.02719543e+01 -1.67589772e+02 4.22e+00 2.11e-15 5.88e-02 0s 8 4.88920111e+01 -3.91983543e+01 2.02e+00 7.24e-16 2.18e-02 0s 9 3.95023337e+01 -2.32790480e+01 1.55e+00 6.92e-16 1.55e-02 0s 10 2.81249124e+01 -1.84027046e+01 1.02e+00 8.29e-16 1.15e-02 0s 11 1.89008102e+01 -9.47640637e+00 6.62e-01 6.55e-16 7.00e-03 0s 12 1.60895908e+01 -6.26151151e+00 4.86e-01 6.90e-16 5.50e-03 0s 13 1.34763390e+01 -4.16962150e+00 3.67e-01 7.97e-16 4.33e-03 0s 14 1.19039842e+01 1.76249350e-01 2.30e-01 7.05e-16 2.86e-03 0s 15 1.03449319e+01 3.17418408e+00 1.28e-01 7.40e-16 1.74e-03 0s 16 8.89516599e+00 6.32381607e+00 1.81e-02 5.85e-16 6.18e-04 0s 17 8.35117227e+00 8.24028183e+00 4.92e-05 4.82e-16 2.66e-05 0s 18 8.33336509e+00 8.33308544e+00 2.81e-12 5.78e-16 6.70e-08 0s 19 8.33333333e+00 8.33333333e+00 1.28e-12 4.66e-16 6.75e-14 0s Barrier solved model in 19 iterations and 0.04 seconds Optimal objective 8.33333333e+00 Root relaxation: objective 8.333333e+00, 1211 iterations, 0.05 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 8.33333 0 37 100.00000 8.33333 91.7% - 0s H 0 0 9.0000000 8.33333 7.41% - 0s Explored 0 nodes (2036 simplex iterations) in 0.20 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.09 seconds Gurobi run time: 0.20 seconds Total run time: 0.28 seconds Objective: 9 Solution: 2 x [1, 3, 5, 5, 5, 5, 5, 5, 5, 8, 10, 10] 1 x [1, 2, 3, 3, 8, 8, 8, 9, 9, 9, 9, 9] 1 x [1, 2, 4, 4, 8, 8, 8, 8, 9, 10] 1 x [1, 2, 4, 4, 4, 4, 8, 8, 8, 8, 9, 10] 1 x [1, 5, 5, 7, 9, 9, 9, 10, 10] 1 x [1, 2, 5, 5, 6, 9, 9, 10, 10] 2 x [1, 2, 8, 8, 8, 9, 9, 9, 9, 10, 10, 10]