Build (method = -2) #dp: 3014 Step-3' Graph: 398 vertices and 1187 arcs (0.02s) Step-4' Graph: 271 vertices and 933 arcs (0.02s) #V4/#V3 = 0.68 #A4/#A3 = 0.79 Ready! (0.02s) Optimize a model with 291 rows, 934 columns and 2264 nonzeros Presolve removed 16 rows and 30 columns Presolve time: 0.01s Presolved: 275 rows, 904 columns, 2242 nonzeros Variable types: 0 continuous, 904 integer (0 binary) Optimize a model with 275 rows, 904 columns and 2242 nonzeros Presolved: 275 rows, 904 columns, 2242 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.625e+03 Factor NZ : 7.166e+03 Factor Ops : 2.601e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.15459025e+03 -1.65370139e+04 2.56e+04 6.17e-02 7.25e+01 0s 1 3.32374960e+02 -9.53250934e+03 3.12e+03 2.90e-02 1.20e+01 0s 2 1.90704621e+02 -2.97280500e+03 6.93e+02 1.45e-03 2.89e+00 0s 3 1.34680541e+02 -4.54127853e+02 7.09e+01 2.00e-15 4.10e-01 0s 4 1.11494626e+02 -2.36198921e+02 7.01e+00 9.99e-16 1.98e-01 0s 5 8.89189043e+01 -1.50612541e+02 3.42e+00 4.44e-16 1.35e-01 0s 6 8.21831044e+01 -9.47607223e+01 2.66e+00 5.55e-16 9.93e-02 0s 7 6.98760828e+01 -3.50449248e+01 1.72e+00 3.33e-16 5.88e-02 0s 8 6.27091155e+01 7.96775099e+00 8.89e-01 3.33e-16 3.06e-02 0s 9 5.60936140e+01 3.55937962e+01 3.28e-01 2.25e-16 1.14e-02 0s 10 5.46173713e+01 4.51491231e+01 1.57e-01 2.33e-16 5.27e-03 0s 11 5.29077213e+01 4.82626733e+01 7.01e-02 2.63e-16 2.58e-03 0s 12 5.25445271e+01 4.91653312e+01 5.02e-02 2.22e-16 1.88e-03 0s 13 5.19881516e+01 5.05537948e+01 2.16e-02 2.22e-16 7.97e-04 0s 14 5.17263580e+01 5.13314066e+01 7.18e-03 3.33e-16 2.20e-04 0s 15 5.16007985e+01 5.15271579e+01 3.34e-04 1.96e-16 4.08e-05 0s 16 5.15901577e+01 5.15893570e+01 3.73e-13 2.22e-16 4.43e-07 0s 17 5.15900002e+01 5.15899994e+01 4.72e-13 2.57e-16 4.43e-10 0s 18 5.15900000e+01 5.15900000e+01 2.04e-13 2.24e-16 4.43e-13 0s Barrier solved model in 18 iterations and 0.02 seconds Optimal objective 5.15900000e+01 Root relaxation: objective 5.159000e+01, 319 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 51.59000 0 59 - 51.59000 - - 0s H 0 0 52.0000000 51.59000 0.79% - 0s Explored 0 nodes (699 simplex iterations) in 0.08 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 5.200000000000e+01, best bound 5.200000000000e+01, gap 0.0% Preprocessing time: 0.03 seconds Gurobi run time: 0.08 seconds Total run time: 0.12 seconds Objective: 52 Solution: 2 x [1, 12, 13, 15] 1 x [12, 15, 16, 18, 19] 8 x [3, 12, 13, 15, 18, 19] 3 x [6, 10, 15, 19, 20] 4 x [3, 9, 15, 16, 17, 20] 5 x [3, 6, 7, 10, 14, 15, 17, 19] 2 x [1, 3, 12, 19, 20] 3 x [1, 12, 14, 17, 19, 20] 2 x [1, 8, 10, 12] 3 x [1, 6, 12, 18] 6 x [4, 12, 16, 20] 1 x [12, 20] 2 x [3, 5, 7, 12, 13, 16, 17, 18] 2 x [1, 3, 4, 7, 13, 16, 19] 1 x [1, 3, 16, 17, 18, 20] 4 x [4, 10, 11, 16, 18, 19] 3 x [2, 3, 6, 7, 13, 16, 19, 20]