Build (method = -2) #dp: 5843 Step-3' Graph: 474 vertices and 1725 arcs (0.03s) Step-4' Graph: 360 vertices and 1498 arcs (0.03s) #V4/#V3 = 0.76 #A4/#A3 = 0.87 Ready! (0.03s) Optimize a model with 370 rows, 1499 columns and 3788 nonzeros Presolve removed 115 rows and 226 columns Presolve time: 0.02s Presolved: 255 rows, 1273 columns, 3462 nonzeros Variable types: 0 continuous, 1273 integer (100 binary) Found heuristic solution: objective 91.0000000 Optimize a model with 255 rows, 1273 columns and 3462 nonzeros Presolved: 255 rows, 1273 columns, 3462 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.990e+03 Factor NZ : 7.971e+03 Factor Ops : 3.512e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.46596118e+03 -2.33433821e+04 3.54e+04 3.38e-02 9.34e+01 0s 1 3.95379963e+02 -1.22361945e+04 4.46e+03 5.55e-16 1.44e+01 0s 2 2.08145368e+02 -4.26559011e+03 8.63e+02 5.55e-16 3.19e+00 0s 3 1.78254486e+02 -8.16523709e+02 1.03e+02 1.27e-14 5.07e-01 0s 4 1.54878008e+02 -2.72783350e+02 1.89e+01 2.78e-15 1.81e-01 0s 5 1.21763407e+02 -1.58387814e+02 1.09e+01 1.78e-15 1.16e-01 0s 6 7.87732833e+01 -8.13756655e+01 5.36e+00 7.77e-16 6.58e-02 0s 7 5.60889598e+01 -6.94762336e+01 3.83e+00 4.41e-16 5.14e-02 0s 8 2.91068587e+01 -2.43829098e+01 1.79e+00 3.17e-16 2.19e-02 0s 9 1.85035187e+01 -5.62349232e+00 9.62e-01 3.89e-16 9.85e-03 0s 10 1.43781550e+01 1.03673825e+00 5.36e-01 3.11e-16 5.40e-03 0s 11 1.33442997e+01 5.42387206e+00 3.72e-01 2.46e-16 3.19e-03 0s 12 1.20239050e+01 7.78720445e+00 2.11e-01 2.40e-16 1.70e-03 0s 13 1.20001638e+01 8.13581707e+00 1.86e-01 3.30e-16 1.55e-03 0s 14 1.09808556e+01 9.58027967e+00 3.54e-02 2.32e-16 5.52e-04 0s 15 1.06341016e+01 1.00870386e+01 1.04e-02 2.91e-16 2.15e-04 0s 16 1.04683730e+01 1.03417356e+01 5.98e-04 2.09e-16 4.96e-05 0s 17 1.04430016e+01 1.04059583e+01 1.80e-04 2.28e-16 1.45e-05 0s 18 1.04308191e+01 1.04212216e+01 1.82e-05 3.33e-16 3.76e-06 0s 19 1.04288249e+01 1.04264703e+01 4.62e-06 2.59e-16 9.22e-07 0s 20 1.04280228e+01 1.04279562e+01 2.98e-08 3.12e-16 2.61e-08 0s 21 1.04280000e+01 1.04280000e+01 5.66e-13 2.79e-16 9.70e-13 0s Barrier solved model in 21 iterations and 0.03 seconds Optimal objective 1.04280000e+01 Root relaxation: objective 1.042800e+01, 229 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 10.42800 0 42 91.00000 10.42800 88.5% - 0s H 0 0 12.0000000 10.42800 13.1% - 0s H 0 0 11.0000000 10.42800 5.20% - 0s Explored 0 nodes (542 simplex iterations) in 0.13 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.100000000000e+01, best bound 1.100000000000e+01, gap 0.0% Preprocessing time: 0.04 seconds Gurobi run time: 0.13 seconds Total run time: 0.17 seconds Objective: 11 Solution: 1 x [1, 2, 4, 4, 4, 6, 8, 9, 9] 1 x [1, 2, 2, 2, 3, 4, 5, 6, 9] 1 x [1, 2, 2, 2, 4, 6, 10, 10, 10] 1 x [1, 3, 4, 4, 5, 6, 6, 7, 9] 3 x [1, 3, 4, 4, 5, 6, 6, 6, 9, 10] 1 x [1, 2, 3, 8, 8, 8, 8, 8, 8, 8] 1 x [1, 1, 2, 2, 2, 2, 3, 5] 1 x [1, 1, 1, 4, 4, 5, 5, 10, 10, 10] 1 x [2, 2, 2, 3, 3, 6]