Build (method = -2) #dp: 21799 Step-3' Graph: 335 vertices and 1350 arcs (0.12s) Step-4' Graph: 250 vertices and 1180 arcs (0.12s) #V4/#V3 = 0.75 #A4/#A3 = 0.87 Ready! (0.12s) Optimize a model with 268 rows, 1181 columns and 3050 nonzeros Presolve removed 51 rows and 105 columns Presolve time: 0.01s Presolved: 217 rows, 1076 columns, 2901 nonzeros Variable types: 0 continuous, 1076 integer (8 binary) Found heuristic solution: objective 165.0000000 Optimize a model with 217 rows, 1076 columns and 2901 nonzeros Presolved: 217 rows, 1076 columns, 2901 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.726e+03 Factor NZ : 5.549e+03 Factor Ops : 1.612e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 3.16431907e+03 -4.13930163e+04 3.73e+04 1.73e-01 1.59e+02 0s 1 8.72806783e+02 -1.68657792e+04 5.81e+03 2.33e-15 2.74e+01 0s 2 3.48894627e+02 -6.62738074e+03 9.97e+02 1.33e-15 5.90e+00 0s 3 2.65621876e+02 -1.58504594e+03 9.01e+01 1.55e-15 1.02e+00 0s 4 1.85248082e+02 -3.44980591e+02 2.69e+01 1.17e-15 2.71e-01 0s 5 1.36330462e+02 -2.73497562e+02 1.84e+01 1.50e-15 2.06e-01 0s 6 9.88458265e+01 -1.51871859e+02 1.07e+01 1.29e-15 1.23e-01 0s 7 6.97242933e+01 -8.52617413e+01 6.26e+00 1.20e-15 7.54e-02 0s 8 4.36334266e+01 -4.61831882e+01 2.61e+00 1.33e-15 4.29e-02 0s 9 3.39151396e+01 -1.07118806e+01 1.37e+00 1.18e-15 2.13e-02 0s 10 3.14621675e+01 1.29312808e+01 8.01e-01 1.00e-15 8.84e-03 0s 11 2.98163689e+01 2.72315992e+01 9.73e-03 1.25e-15 1.19e-03 0s 12 2.85740718e+01 2.85499225e+01 6.77e-14 8.31e-16 1.11e-05 0s 13 2.85714286e+01 2.85714281e+01 8.94e-14 1.13e-15 2.13e-10 0s 14 2.85714286e+01 2.85714286e+01 5.69e-14 1.20e-15 3.46e-16 0s Barrier solved model in 14 iterations and 0.01 seconds Optimal objective 2.85714286e+01 Root relaxation: objective 2.857143e+01, 674 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 23 165.00000 28.57143 82.7% - 0s H 0 0 29.0000000 28.57143 1.48% - 0s Explored 0 nodes (1360 simplex iterations) in 0.08 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.13 seconds Gurobi run time: 0.08 seconds Total run time: 0.21 seconds Objective: 29 Solution: 3 x [5, 8, 9, 10, 13, 13, 14] 5 x [5, 7, 7, 8, 9, 11, 13] 1 x [4, 5, 6, 7, 12, 14, 15] 4 x [3, 5, 7, 7, 12, 16, 17] 7 x [3, 11, 12, 14, 16, 17, 18] 1 x [7, 7, 13, 13, 14, 14, 18] 1 x [2, 3, 15, 18, 18] 1 x [4, 9, 10, 13, 13, 14] 2 x [7, 7, 8, 8, 8, 8, 8] 1 x [1, 3, 6, 7, 12, 12, 15] 2 x [1, 3, 6, 7, 7, 16, 16] 1 x [3, 4, 7, 7, 7, 12, 15]