Build (method = -2) #dp: 304279 Step-3' Graph: 411 vertices and 1351 arcs (4.08s) Step-4' Graph: 176 vertices and 881 arcs (4.09s) #V4/#V3 = 0.43 #A4/#A3 = 0.65 Ready! (4.09s) Optimize a model with 228 rows, 882 columns and 2301 nonzeros Presolve removed 50 rows and 94 columns Presolve time: 0.01s Presolved: 178 rows, 788 columns, 2139 nonzeros Variable types: 0 continuous, 788 integer (65 binary) Found heuristic solution: objective 120.0000000 Found heuristic solution: objective 81.0000000 Optimize a model with 178 rows, 788 columns and 2139 nonzeros Presolved: 178 rows, 788 columns, 2139 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.162e+03 Factor NZ : 2.911e+03 Factor Ops : 6.151e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 6.01049365e+03 -6.85608941e+03 1.38e+04 1.85e-01 7.07e+01 0s 1 1.52519737e+03 -2.63110510e+03 2.72e+03 5.55e-16 1.40e+01 0s 2 2.45527340e+02 -1.13184013e+03 2.60e+02 4.44e-16 1.85e+00 0s 3 9.96198315e+01 -2.89370736e+02 1.49e+01 2.02e-14 2.72e-01 0s 4 5.54661784e+01 -7.27592945e+01 2.70e+00 5.88e-15 8.24e-02 0s 5 4.10125938e+01 -3.87371514e+01 1.26e+00 4.00e-15 5.05e-02 0s 6 3.20841624e+01 2.94393711e+00 5.37e-01 1.33e-15 1.83e-02 0s 7 2.98843654e+01 2.19416583e+01 2.77e-01 2.48e-16 5.01e-03 0s 8 2.87543748e+01 2.79942365e+01 7.97e-04 3.62e-16 4.70e-04 0s 9 2.84035200e+01 2.83774853e+01 2.49e-05 3.34e-16 1.61e-05 0s 10 2.84000035e+01 2.83999775e+01 1.95e-14 3.24e-16 1.61e-08 0s 11 2.84000000e+01 2.84000000e+01 6.03e-14 4.44e-16 1.61e-11 0s Barrier solved model in 11 iterations and 0.01 seconds Optimal objective 2.84000000e+01 Root relaxation: objective 2.840000e+01, 533 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 28.40000 0 13 81.00000 28.40000 64.9% - 0s H 0 0 29.0000000 28.40000 2.07% - 0s Explored 0 nodes (687 simplex iterations) in 0.05 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: 4.10 seconds Gurobi run time: 0.05 seconds Total run time: 4.15 seconds Objective: 29 Solution: 1 x [12, 24, 47, 48, 50] 1 x [18, 21, 25, 27, 40] 1 x [18, 23, 25, 32, 40] 1 x [5, 15, 40, 42, 46] 1 x [10, 15, 18, 44, 46] 2 x [5, 10, 11, 28, 51] 1 x [1, 11, 18, 34, 45] 1 x [5, 22, 33, 44, 44] 1 x [7, 8, 16, 31, 32] 1 x [13, 20, 43, 45] 1 x [13, 20, 43, 43, 45] 1 x [2, 5, 20, 34, 52] 3 x [17, 19, 35, 39, 41] 1 x [6, 33, 36, 49] 1 x [6, 33, 36, 36, 49] 1 x [8, 13, 14, 16, 17] 2 x [3, 4, 5, 26, 30] 1 x [5, 8, 50, 52] 4 x [3, 9, 26, 29, 31] 3 x [37, 38, 48, 49, 50]