Build (method = -2) #dp: 21846 Step-3' Graph: 380 vertices and 1993 arcs (0.12s) Step-4' Graph: 305 vertices and 1843 arcs (0.12s) #V4/#V3 = 0.80 #A4/#A3 = 0.92 Ready! (0.12s) Optimize a model with 324 rows, 1844 columns and 4926 nonzeros Presolve removed 40 rows and 74 columns Presolve time: 0.02s Presolved: 284 rows, 1770 columns, 4856 nonzeros Variable types: 0 continuous, 1770 integer (175 binary) Found heuristic solution: objective 198.0000000 Optimize a model with 284 rows, 1770 columns and 4856 nonzeros Presolved: 284 rows, 1770 columns, 4856 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 3.052e+03 Factor NZ : 1.295e+04 Factor Ops : 8.278e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 3.10597382e+03 -8.32384363e+04 4.52e+04 2.22e-16 1.65e+02 0s 1 8.62785131e+02 -3.28489376e+04 7.48e+03 1.11e-15 3.04e+01 0s 2 3.66257402e+02 -1.21787709e+04 1.56e+03 1.42e-14 7.21e+00 0s 3 2.26690702e+02 -3.34083145e+03 2.59e+02 8.41e-15 1.48e+00 0s 4 2.00911755e+02 -6.43097071e+02 3.02e+01 4.50e-15 2.69e-01 0s 5 1.96480754e+02 -3.41492905e+02 9.82e+00 6.95e-15 1.58e-01 0s 6 1.49750087e+02 -3.47924687e+02 3.84e+00 6.87e-15 1.43e-01 0s 7 1.07809227e+02 -1.65234962e+02 2.46e+00 5.66e-15 7.83e-02 0s 8 7.02535888e+01 -8.34169420e+01 1.53e+00 4.99e-15 4.40e-02 0s 9 5.57866243e+01 -6.87552380e+01 1.13e+00 6.63e-15 3.56e-02 0s 10 3.78741476e+01 -1.35022443e+01 5.63e-01 4.29e-15 1.47e-02 0s 11 3.51490151e+01 5.62171974e+00 4.06e-01 6.26e-15 8.42e-03 0s 12 3.20692464e+01 1.59022840e+01 2.91e-01 5.47e-15 4.61e-03 0s 13 2.98585998e+01 2.32034825e+01 7.45e-02 4.80e-15 1.88e-03 0s 14 2.88119407e+01 2.75311151e+01 1.18e-02 3.55e-15 3.61e-04 0s 15 2.85742975e+01 2.85523433e+01 7.28e-14 3.89e-15 6.17e-06 0s 16 2.85714314e+01 2.85714095e+01 9.35e-14 3.21e-15 6.17e-09 0s 17 2.85714286e+01 2.85714286e+01 1.39e-13 4.92e-15 6.17e-12 0s Barrier solved model in 17 iterations and 0.03 seconds Optimal objective 2.85714286e+01 Root relaxation: objective 2.857143e+01, 1155 iterations, 0.05 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 28.57143 0 53 198.00000 28.57143 85.6% - 0s H 0 0 29.0000000 28.57143 1.48% - 0s Explored 0 nodes (2221 simplex iterations) in 0.19 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.19 seconds Total run time: 0.33 seconds Objective: 29 Solution: 6 x [3, 8, 10, 12, 12, 15, 18] 4 x [1, 2, 4, 7, 7, 9, 18] 1 x [4, 5, 6, 6, 6, 6, 18] 1 x [3, 5, 11, 14, 16, 17] 6 x [3, 5, 11, 11, 14, 16, 17] 1 x [4, 4, 9, 12, 12, 12, 17] 2 x [1, 5, 9, 10, 14, 15, 16] 1 x [5, 7, 10, 10, 16, 17, 19] 3 x [2, 4, 5, 7, 7, 8, 15] 1 x [4, 7, 7, 9, 9, 13] 1 x [2, 4, 5, 7, 7, 15] 2 x [4, 6, 6, 6, 6, 9, 10]