Build (method = -2) #dp: 3619 Step-3' Graph: 271 vertices and 1016 arcs (0.02s) Step-4' Graph: 225 vertices and 924 arcs (0.02s) #V4/#V3 = 0.83 #A4/#A3 = 0.91 Ready! (0.02s) Optimize a model with 234 rows, 925 columns and 2337 nonzeros Presolve removed 83 rows and 157 columns Presolve time: 0.01s Presolved: 151 rows, 768 columns, 2118 nonzeros Variable types: 0 continuous, 768 integer (0 binary) Found heuristic solution: objective 799.0000000 Optimize a model with 151 rows, 768 columns and 2118 nonzeros Presolved: 151 rows, 768 columns, 2118 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.179e+03 Factor NZ : 3.938e+03 Factor Ops : 1.251e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 5.59042903e+03 -1.01167104e+05 7.70e+04 2.22e-16 3.83e+02 0s 1 1.81613331e+03 -4.74710151e+04 1.18e+04 5.55e-16 7.19e+01 0s 2 1.14090584e+03 -1.35928304e+04 2.28e+03 5.55e-16 1.51e+01 0s 3 9.49987961e+02 -3.21709721e+03 2.23e+01 2.44e-15 2.73e+00 0s 4 7.04654679e+02 -1.31898119e+03 1.96e-02 1.11e-15 1.31e+00 0s 5 4.93223623e+02 -5.41614844e+02 9.56e-03 6.66e-16 6.70e-01 0s 6 3.66537548e+02 -3.27673557e+02 6.63e-03 3.33e-16 4.49e-01 0s 7 2.35821543e+02 -1.17805953e+02 3.94e-03 2.38e-16 2.29e-01 0s 8 1.68400981e+02 1.11921824e+01 2.08e-03 2.32e-16 1.02e-01 0s 9 1.29621484e+02 5.17433771e+01 1.02e-03 1.90e-16 5.04e-02 0s 10 1.26511821e+02 8.53354562e+01 7.35e-04 1.47e-16 2.67e-02 0s 11 1.15815664e+02 1.02640308e+02 1.43e-04 2.22e-16 8.53e-03 0s 12 1.13038329e+02 1.07298928e+02 5.37e-05 2.22e-16 3.71e-03 0s 13 1.11296675e+02 1.09651149e+02 5.52e-06 2.49e-16 1.07e-03 0s 14 1.11131439e+02 1.10929538e+02 2.00e-07 2.22e-16 1.31e-04 0s 15 1.11111124e+02 1.11111018e+02 2.37e-10 2.80e-16 6.85e-08 0s 16 1.11111111e+02 1.11111111e+02 1.84e-10 2.22e-16 6.85e-11 0s Barrier solved model in 16 iterations and 0.01 seconds Optimal objective 1.11111111e+02 Root relaxation: objective 1.111111e+02, 376 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 111.11111 0 38 799.00000 111.11111 86.1% - 0s H 0 0 112.0000000 111.11111 0.79% - 0s Explored 0 nodes (701 simplex iterations) in 0.06 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.120000000000e+02, best bound 1.120000000000e+02, gap 0.0% Preprocessing time: 0.03 seconds Gurobi run time: 0.06 seconds Total run time: 0.08 seconds Objective: 112 Solution: 1 x [1, 1, 1, 4, 6, 9] 46 x [1, 2, 2, 3, 4, 4, 6, 6, 9] 1 x [1, 1, 1, 3, 4, 4, 6, 6, 9] 5 x [1, 4, 4, 7, 7, 7, 7, 8, 8] 9 x [1, 1, 1, 1, 3, 5, 5, 5, 9] 23 x [1, 1, 1, 3, 5, 5, 5, 7, 8] 1 x [5, 5, 5, 7, 7, 7, 8] 1 x [2, 5, 5, 5, 7, 7, 7, 8] 10 x [2, 2, 5, 5, 5, 7, 7, 7, 8] 13 x [2, 2, 5, 5, 5, 6, 7, 8, 8] 2 x [1, 7, 8, 8, 8, 8, 8, 8]