Build (method = -2) #dp: 2282 Step-3' Graph: 235 vertices and 1242 arcs (0.01s) Step-4' Graph: 211 vertices and 1194 arcs (0.02s) #V4/#V3 = 0.90 #A4/#A3 = 0.96 Ready! (0.02s) Optimize a model with 231 rows, 1195 columns and 3170 nonzeros Presolve removed 39 rows and 74 columns Presolve time: 0.01s Presolved: 192 rows, 1121 columns, 3074 nonzeros Variable types: 0 continuous, 1121 integer (0 binary) Found heuristic solution: objective 170.0000000 Found heuristic solution: objective 155.0000000 Optimize a model with 192 rows, 1121 columns and 3074 nonzeros Presolved: 192 rows, 1121 columns, 3074 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.811e+03 Factor NZ : 6.349e+03 Factor Ops : 2.827e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.72098658e+03 -2.84002945e+04 1.94e+04 2.22e-16 9.68e+01 0s 1 6.27107610e+02 -1.37120224e+04 3.89e+03 8.88e-16 2.13e+01 0s 2 2.58779394e+02 -5.64430060e+03 4.83e+02 3.26e-14 4.12e+00 0s 3 1.99075340e+02 -1.66414967e+03 3.00e+01 8.22e-15 8.88e-01 0s 4 1.88159300e+02 -5.58837686e+02 2.52e-02 3.33e-15 3.31e-01 0s 5 1.61869346e+02 -2.63666776e+02 1.40e-02 1.22e-15 1.88e-01 0s 6 1.29008121e+02 -9.56639882e+01 7.06e-03 5.55e-16 9.95e-02 0s 7 1.12717566e+02 -3.00347586e+01 5.26e-03 3.33e-16 6.32e-02 0s 8 8.21714837e+01 2.05389674e+01 1.82e-03 3.44e-16 2.73e-02 0s 9 6.76877394e+01 4.35017372e+01 8.12e-04 3.05e-16 1.07e-02 0s 10 6.44556794e+01 5.01920649e+01 5.17e-04 2.75e-16 6.32e-03 0s 11 6.26346545e+01 5.33915880e+01 3.63e-04 1.60e-16 4.09e-03 0s 12 6.16820414e+01 5.47050024e+01 2.52e-04 2.21e-16 3.09e-03 0s 13 6.12430715e+01 5.63897696e+01 2.06e-04 2.14e-16 2.15e-03 0s 14 6.03932139e+01 5.72123450e+01 1.09e-04 2.22e-16 1.41e-03 0s 15 6.00166614e+01 5.76648324e+01 6.73e-05 1.52e-16 1.04e-03 0s 16 5.97132454e+01 5.83584817e+01 3.57e-05 2.51e-16 6.00e-04 0s 17 5.94765081e+01 5.88885244e+01 1.62e-05 2.22e-16 2.60e-04 0s 18 5.93907028e+01 5.90217914e+01 1.02e-05 2.49e-16 1.63e-04 0s 19 5.93643312e+01 5.90520013e+01 8.85e-06 2.23e-16 1.38e-04 0s 20 5.93253713e+01 5.91367564e+01 6.59e-06 2.18e-16 8.35e-05 0s 21 5.93067337e+01 5.91491289e+01 5.25e-06 2.86e-16 6.98e-05 0s 22 5.92667740e+01 5.91717581e+01 2.58e-06 2.07e-16 4.21e-05 0s 23 5.92598546e+01 5.91835067e+01 2.28e-06 2.22e-16 3.38e-05 0s 24 5.92158730e+01 5.91829160e+01 6.00e-07 1.37e-16 1.46e-05 0s 25 5.92071320e+01 5.92004793e+01 2.29e-07 3.49e-16 2.95e-06 0s 26 5.92011779e+01 5.92011699e+01 6.14e-13 2.80e-16 3.53e-09 0s 27 5.92011719e+01 5.92011719e+01 4.42e-11 3.33e-16 4.15e-15 0s Barrier solved model in 27 iterations and 0.03 seconds Optimal objective 5.92011719e+01 Root relaxation: objective 5.920117e+01, 165 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 59.20117 0 29 155.00000 59.20117 61.8% - 0s H 0 0 60.0000000 59.20117 1.33% - 0s Explored 0 nodes (229 simplex iterations) in 0.07 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 6.000000000000e+01, best bound 6.000000000000e+01, gap 0.0% Preprocessing time: 0.03 seconds Gurobi run time: 0.07 seconds Total run time: 0.11 seconds Objective: 60 Solution: 2 x [2, 8, 12, 17] 10 x [1, 6] 2 x [6, 9, 16] 5 x [6, 8, 15, 17] 3 x [10, 18] 3 x [3, 13, 13, 19] 3 x [9, 12, 12, 19] 2 x [11, 16, 20] 3 x [11, 12, 15, 20] 1 x [9, 11, 17] 1 x [9, 11, 17, 17] 1 x [11, 11] 3 x [4, 12, 17, 18] 3 x [18, 20, 20] 1 x [12, 18, 18] 1 x [14, 14, 20] 2 x [3, 4, 7, 20] 10 x [3, 4, 9, 13] 1 x [4, 5, 20] 1 x [4, 5, 5, 20] 1 x [4, 7, 20] 1 x [4, 4, 7, 20]