Build (method = -2) #dp: 22726 Step-3' Graph: 321 vertices and 1491 arcs (0.13s) Step-4' Graph: 228 vertices and 1306 arcs (0.13s) #V4/#V3 = 0.71 #A4/#A3 = 0.88 Ready! (0.13s) Optimize a model with 247 rows, 1307 columns and 3474 nonzeros Presolve removed 32 rows and 60 columns Presolve time: 0.02s Presolved: 215 rows, 1247 columns, 3429 nonzeros Variable types: 0 continuous, 1247 integer (153 binary) Found heuristic solution: objective 153.0000000 Optimize a model with 215 rows, 1247 columns and 3429 nonzeros Presolved: 215 rows, 1247 columns, 3429 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 2.008e+03 Factor NZ : 6.164e+03 Factor Ops : 2.149e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 2.91252810e+03 -2.27260695e+04 3.17e+04 1.90e-01 9.24e+01 0s 1 6.86706524e+02 -9.87349688e+03 4.85e+03 6.66e-16 1.56e+01 0s 2 2.76059271e+02 -3.71130661e+03 8.18e+02 8.33e-16 3.18e+00 0s 3 1.86953259e+02 -1.02560816e+03 5.93e+01 1.44e-15 5.69e-01 0s 4 1.38975228e+02 -4.37985954e+02 2.16e+01 3.33e-15 2.52e-01 0s 5 1.08760809e+02 -2.32794301e+02 1.15e+01 1.67e-15 1.46e-01 0s 6 9.74741781e+01 -1.96298077e+02 9.68e+00 1.55e-15 1.25e-01 0s 7 5.83978690e+01 -8.89438869e+01 4.93e+00 7.77e-16 6.22e-02 0s 8 4.20956842e+01 -7.31977040e+00 2.46e+00 4.86e-16 2.10e-02 0s 9 3.45559964e+01 9.92753402e+00 1.42e+00 5.25e-16 1.04e-02 0s 10 3.03337638e+01 2.21528127e+01 5.78e-01 3.75e-16 3.43e-03 0s 11 2.99067508e+01 2.69015557e+01 2.91e-01 5.39e-16 1.25e-03 0s 12 2.86007875e+01 2.84112820e+01 5.21e-13 7.73e-16 7.55e-05 0s 13 2.85714636e+01 2.85713178e+01 1.25e-12 4.83e-16 5.81e-08 0s 14 2.85714286e+01 2.85714286e+01 1.46e-12 6.72e-16 5.85e-14 0s Barrier solved model in 14 iterations and 0.02 seconds Optimal objective 2.85714286e+01 Root relaxation: objective 2.857143e+01, 872 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 28.57143 0 34 153.00000 28.57143 81.3% - 0s H 0 0 29.0000000 28.57143 1.48% - 0s Explored 0 nodes (1440 simplex iterations) in 0.10 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 2.900000000000e+01, best bound 2.900000000000e+01, gap 0.0% Preprocessing time: 0.14 seconds Gurobi run time: 0.10 seconds Total run time: 0.24 seconds Objective: 29 Solution: 5 x [2, 6, 7, 13, 13, 14, 16] 1 x [2, 6, 8, 9, 11, 12, 16] 2 x [2, 8, 8, 8, 8, 12, 16] 1 x [1, 2, 14, 14, 16, 16] 1 x [1, 1, 2, 14, 14, 16, 16] 2 x [2, 6, 7, 13, 14, 15, 17] 1 x [2, 6, 7, 11, 12, 13, 17] 5 x [1, 2, 3, 3, 14, 17, 18] 3 x [2, 8, 14, 17, 19, 19, 19] 3 x [4, 11, 13, 16, 17, 19, 19] 1 x [3, 5, 11, 13, 16, 16] 1 x [3, 10, 16, 16, 16, 17, 19] 1 x [4, 4, 4, 4, 8, 11] 2 x [4, 4, 4, 4, 4, 8, 11]