Build (method = -2) #dp: 2909 Step-3' Graph: 286 vertices and 1095 arcs (0.01s) Step-4' Graph: 239 vertices and 1001 arcs (0.02s) #V4/#V3 = 0.84 #A4/#A3 = 0.91 Ready! (0.02s) Optimize a model with 249 rows, 1002 columns and 2540 nonzeros Presolve removed 81 rows and 152 columns Presolve time: 0.01s Presolved: 168 rows, 850 columns, 2328 nonzeros Variable types: 0 continuous, 850 integer (57 binary) Found heuristic solution: objective 99.0000000 Found heuristic solution: objective 96.0000000 Optimize a model with 168 rows, 850 columns and 2328 nonzeros Presolved: 168 rows, 850 columns, 2328 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.304e+03 Factor NZ : 4.314e+03 Factor Ops : 1.315e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 6.10575783e+02 -1.13140326e+04 9.61e+03 5.27e-02 4.09e+01 0s 1 2.02473122e+02 -6.39153901e+03 1.45e+03 6.66e-16 8.19e+00 0s 2 1.33402195e+02 -1.93070330e+03 2.77e+02 7.22e-16 1.82e+00 0s 3 9.70121824e+01 -3.22787382e+02 1.69e+01 5.27e-16 2.71e-01 0s 4 7.38234785e+01 -1.63749372e+02 1.44e+00 3.54e-16 1.41e-01 0s 5 5.01432109e+01 -9.03085614e+01 7.30e-01 4.16e-16 8.29e-02 0s 6 3.46661111e+01 -4.18946249e+01 4.33e-01 3.69e-16 4.52e-02 0s 7 2.18200879e+01 -1.24874746e+01 2.39e-01 3.33e-16 2.03e-02 0s 8 1.68592868e+01 -3.73350003e+00 1.19e-01 1.70e-16 1.21e-02 0s 9 1.39995467e+01 9.97822340e-01 6.23e-02 2.22e-16 7.64e-03 0s 10 1.38346956e+01 4.52861452e+00 3.64e-02 2.07e-15 5.46e-03 0s 11 1.20775344e+01 9.80756910e+00 3.45e-03 9.30e-16 1.33e-03 0s 12 1.15941733e+01 1.09330568e+01 5.23e-04 9.37e-16 3.87e-04 0s 13 1.14864689e+01 1.11625961e+01 2.33e-04 9.67e-16 1.90e-04 0s 14 1.14252824e+01 1.12667140e+01 7.81e-05 1.11e-15 9.28e-05 0s 15 1.14079857e+01 1.13153281e+01 4.58e-05 1.38e-15 5.42e-05 0s 16 1.13843425e+01 1.13577741e+01 9.28e-06 9.60e-16 1.55e-05 0s 17 1.13794989e+01 1.13633112e+01 5.17e-06 1.20e-15 9.47e-06 0s 18 1.13749723e+01 1.13702057e+01 1.68e-06 9.07e-16 2.79e-06 0s 19 1.13727382e+01 1.13725627e+01 3.50e-08 9.51e-16 1.03e-07 0s 20 1.13726710e+01 1.13726707e+01 6.34e-11 1.13e-15 1.96e-10 0s 21 1.13726708e+01 1.13726708e+01 2.29e-12 8.82e-16 2.05e-16 0s Barrier solved model in 21 iterations and 0.02 seconds Optimal objective 1.13726708e+01 Root relaxation: objective 1.137267e+01, 115 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 11.37267 0 41 96.00000 11.37267 88.2% - 0s H 0 0 12.0000000 11.37267 5.23% - 0s Explored 0 nodes (241 simplex iterations) in 0.05 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.02 seconds Gurobi run time: 0.05 seconds Total run time: 0.08 seconds Objective: 12 Solution: 2 x [1, 1, 1, 2, 7, 8, 9, 9, 10] 1 x [7, 8, 10, 10] 1 x [2, 2, 3, 3, 5, 5, 7, 10, 10] 1 x [2, 2, 3, 5, 10, 10] 2 x [1, 2, 3, 5, 5, 7, 7, 8, 9] 2 x [1, 4, 4, 4, 4, 5, 5, 8, 9] 2 x [2, 2, 2, 3, 3, 3, 8, 8, 9] 1 x [2, 2, 4, 5, 6, 9, 9, 9, 9]