Build (method = -2) #dp: 3089 Step-3' Graph: 170 vertices and 588 arcs (0.01s) Step-4' Graph: 116 vertices and 480 arcs (0.01s) #V4/#V3 = 0.68 #A4/#A3 = 0.82 Ready! (0.01s) Optimize a model with 125 rows, 481 columns and 1217 nonzeros Presolve removed 36 rows and 69 columns Presolve time: 0.01s Presolved: 89 rows, 412 columns, 1118 nonzeros Variable types: 0 continuous, 412 integer (0 binary) Found heuristic solution: objective 92.0000000 Found heuristic solution: objective 66.0000000 Optimize a model with 89 rows, 412 columns and 1118 nonzeros Presolved: 89 rows, 412 columns, 1118 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 6.190e+02 Factor NZ : 1.807e+03 Factor Ops : 4.071e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.03247502e+03 -1.11283196e+04 8.95e+03 2.22e-16 9.93e+01 0s 1 2.89475481e+02 -4.56145984e+03 1.35e+03 8.88e-16 1.65e+01 0s 2 1.25132188e+02 -1.61914183e+03 1.96e+02 6.66e-16 3.29e+00 0s 3 9.37545665e+01 -2.44927955e+02 8.01e+00 7.22e-16 4.32e-01 0s 4 6.47814732e+01 -8.00561291e+01 9.88e-03 4.44e-16 1.74e-01 0s 5 3.62521996e+01 -3.09536207e+01 5.30e-03 2.78e-16 8.07e-02 0s 6 2.50530218e+01 -5.74509660e+00 3.42e-03 2.46e-16 3.70e-02 0s 7 1.50867633e+01 1.57210895e+00 1.43e-03 2.22e-16 1.62e-02 0s 8 1.44441904e+01 9.41729559e+00 8.42e-04 2.22e-16 6.04e-03 0s 9 1.28460061e+01 1.18251880e+01 1.02e-04 2.22e-16 1.23e-03 0s 10 1.25031915e+01 1.24884921e+01 7.30e-14 1.71e-16 1.76e-05 0s 11 1.25000032e+01 1.24999885e+01 1.05e-13 2.01e-16 1.76e-08 0s 12 1.25000000e+01 1.25000000e+01 1.65e-13 4.44e-16 1.76e-11 0s Barrier solved model in 12 iterations and 0.00 seconds Optimal objective 1.25000000e+01 Root relaxation: objective 1.250000e+01, 226 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 10 66.00000 12.50000 81.1% - 0s H 0 0 13.0000000 12.50000 3.85% - 0s Explored 0 nodes (344 simplex iterations) in 0.02 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.02 seconds Total run time: 0.05 seconds Objective: 13 Solution: 1 x [1, 2, 2, 4, 5, 8] 1 x [1, 4, 4, 8, 8, 8, 8] 5 x [1, 1, 2, 2, 4, 7, 7, 8] 1 x [1, 1, 1, 6, 9, 9, 9] 2 x [2, 4, 6, 6, 8, 8, 8, 8] 2 x [2, 2, 4, 4, 5, 5, 7, 7] 1 x [2, 2, 3, 3, 3, 3, 5, 5]