Build (method = -2) #dp: 21357 Step-3' Graph: 320 vertices and 1408 arcs (0.11s) Step-4' Graph: 223 vertices and 1214 arcs (0.11s) #V4/#V3 = 0.70 #A4/#A3 = 0.86 Ready! (0.11s) Optimize a model with 242 rows, 1215 columns and 3209 nonzeros Presolve removed 19 rows and 34 columns Presolve time: 0.01s Presolved: 223 rows, 1181 columns, 3178 nonzeros Variable types: 0 continuous, 1181 integer (63 binary) Found heuristic solution: objective 196.0000000 Found heuristic solution: objective 175.0000000 Optimize a model with 223 rows, 1181 columns and 3178 nonzeros Presolved: 223 rows, 1181 columns, 3178 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.932e+03 Factor NZ : 6.316e+03 Factor Ops : 2.189e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 2.66172145e+03 -2.62027051e+04 2.97e+04 6.20e-02 1.03e+02 0s 1 5.84884184e+02 -1.13807521e+04 3.75e+03 1.11e-15 1.51e+01 0s 2 2.69395033e+02 -4.62037299e+03 7.44e+02 9.99e-16 3.68e+00 0s 3 1.97389030e+02 -1.15772319e+03 7.44e+01 6.66e-16 6.85e-01 0s 4 1.66249111e+02 -3.32292261e+02 1.68e+01 1.89e-15 2.24e-01 0s 5 1.05678308e+02 -1.82289039e+02 7.55e+00 8.88e-16 1.26e-01 0s 6 8.59194991e+01 -1.28482541e+02 5.28e+00 8.74e-16 9.36e-02 0s 7 6.16200025e+01 -6.54882884e+01 3.16e+00 5.55e-16 5.53e-02 0s 8 4.43186073e+01 -1.56285328e+01 1.40e+00 7.77e-16 2.59e-02 0s 9 3.83021956e+01 6.30736406e+00 1.02e+00 5.55e-16 1.39e-02 0s 10 3.19038434e+01 1.66574561e+01 5.12e-01 7.77e-16 6.60e-03 0s 11 2.96508121e+01 2.43599956e+01 2.23e-01 7.78e-16 2.28e-03 0s 12 2.92002121e+01 2.78078278e+01 1.08e-01 7.77e-16 6.02e-04 0s 13 2.85728770e+01 2.85619420e+01 7.75e-05 6.89e-16 4.60e-06 0s 14 2.85714286e+01 2.85714285e+01 1.58e-10 7.77e-16 1.17e-11 0s Barrier solved model in 14 iterations and 0.02 seconds Optimal objective 2.85714286e+01 Root relaxation: objective 2.857143e+01, 821 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 24 175.00000 28.57143 83.7% - 0s H 0 0 29.0000000 28.57143 1.48% - 0s Explored 0 nodes (1311 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.12 seconds Gurobi run time: 0.08 seconds Total run time: 0.20 seconds Objective: 29 Solution: 4 x [1, 1, 2, 5, 7, 11, 19] 1 x [2, 2, 16, 18, 19] 1 x [5, 8, 9, 10, 18, 18, 19] 1 x [3, 8, 8, 10, 16, 18, 19] 4 x [4, 4, 4, 6, 9, 11, 19] 6 x [5, 12, 14, 16, 17, 18, 19] 4 x [1, 2, 3, 13, 13, 14, 16] 4 x [2, 5, 7, 8, 9, 10, 16] 1 x [2, 2, 9, 10, 12, 15, 16] 1 x [2, 2, 6, 6, 17, 17] 2 x [3, 6, 6, 6, 14, 17, 17]