Build (method = -2) #dp: 5402 Step-3' Graph: 292 vertices and 1106 arcs (0.03s) Step-4' Graph: 236 vertices and 994 arcs (0.03s) #V4/#V3 = 0.81 #A4/#A3 = 0.90 Ready! (0.03s) Optimize a model with 246 rows, 995 columns and 2522 nonzeros Presolve removed 79 rows and 151 columns Presolve time: 0.01s Presolved: 167 rows, 844 columns, 2327 nonzeros Variable types: 0 continuous, 844 integer (0 binary) Found heuristic solution: objective 61.0000000 Optimize a model with 167 rows, 844 columns and 2327 nonzeros Presolved: 167 rows, 844 columns, 2327 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.302e+03 Factor NZ : 4.424e+03 Factor Ops : 1.472e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 8.88121707e+02 -1.92322763e+04 1.22e+04 2.22e-16 7.15e+01 0s 1 3.01389530e+02 -8.58812163e+03 2.23e+03 6.66e-16 1.45e+01 0s 2 1.60648168e+02 -3.02455408e+03 4.67e+02 2.22e-15 3.38e+00 0s 3 1.47041000e+02 -6.39787465e+02 3.77e+01 1.58e-14 5.47e-01 0s 4 1.10851833e+02 -3.06940250e+02 1.10e+01 7.33e-15 2.64e-01 0s 5 9.07139232e+01 -1.43274047e+02 6.51e+00 3.77e-15 1.45e-01 0s 6 5.82186782e+01 -1.13210798e+02 4.37e+00 3.00e-15 1.06e-01 0s 7 3.99229557e+01 -5.80607336e+01 2.57e+00 1.33e-15 6.01e-02 0s 8 2.83899567e+01 -2.78756683e+01 1.66e+00 6.66e-16 3.45e-02 0s 9 1.96273538e+01 -1.19749177e+01 1.00e+00 4.44e-16 1.94e-02 0s 10 1.46754138e+01 -1.15991222e+00 5.37e-01 2.22e-16 9.68e-03 0s 11 1.30735861e+01 4.24123526e+00 3.09e-01 3.33e-16 5.37e-03 0s 12 1.30628704e+01 5.59698252e+00 2.70e-01 1.63e-16 4.53e-03 0s 13 1.15566390e+01 9.82771678e+00 6.47e-02 1.95e-16 1.04e-03 0s 14 1.11274834e+01 1.10382850e+01 1.18e-03 3.33e-16 5.28e-05 0s 15 1.11111279e+01 1.11110382e+01 1.39e-12 2.99e-16 5.29e-08 0s 16 1.11111111e+01 1.11111110e+01 8.00e-14 3.33e-16 5.29e-11 0s Barrier solved model in 16 iterations and 0.01 seconds Optimal objective 1.11111111e+01 Root relaxation: objective 1.111111e+01, 473 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 11.11111 0 32 61.00000 11.11111 81.8% - 0s H 0 0 16.0000000 11.11111 30.6% - 0s H 0 0 12.0000000 11.11111 7.41% - 0s Explored 0 nodes (914 simplex iterations) in 0.07 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.200000000000e+01, best bound 1.200000000000e+01, gap 0.0% Preprocessing time: 0.04 seconds Gurobi run time: 0.07 seconds Total run time: 0.10 seconds Objective: 12 Solution: 2 x [2, 4, 5, 5, 6, 6, 8, 9, 9] 1 x [2, 3, 3, 3, 7, 7, 9, 10] 3 x [2, 3, 3, 3, 7, 7, 7, 9, 10] 2 x [1, 3, 4, 4, 7, 7, 10, 10, 10] 1 x [1, 4, 4, 4, 4, 7] 1 x [1, 1, 4, 8, 8, 8] 1 x [1, 1, 1, 1, 6, 10, 10, 10] 1 x [4, 5, 5, 6, 6, 8, 9, 9, 9]