Build (method = -2) #dp: 10913 Step-3' Graph: 310 vertices and 4586 arcs (0.09s) Step-4' Graph: 219 vertices and 4385 arcs (0.09s) #V4/#V3 = 0.71 #A4/#A3 = 0.96 Ready! (0.09s) Optimize a model with 275 rows, 4386 columns and 12721 nonzeros Presolve removed 6 rows and 7 columns Presolve time: 0.05s Presolved: 269 rows, 4379 columns, 12711 nonzeros Variable types: 0 continuous, 4379 integer (1777 binary) Found heuristic solution: objective 64.0000000 Optimize a model with 269 rows, 4379 columns and 12711 nonzeros Presolved: 269 rows, 4379 columns, 12711 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 7.446e+03 Factor NZ : 1.674e+04 (roughly 2 MBytes of memory) Factor Ops : 1.399e+06 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 6.98622086e+03 -4.09487280e+04 1.05e+05 1.82e-01 4.83e+01 0s 1 1.76596886e+03 -1.05601607e+04 1.85e+04 2.55e-15 8.63e+00 0s 2 4.03977236e+02 -3.57699785e+03 2.23e+03 1.44e-15 1.25e+00 0s 3 1.90789259e+02 -1.24622369e+03 2.37e+02 1.11e-15 2.32e-01 0s 4 9.04038670e+01 -2.29397875e+02 3.21e+01 1.33e-15 4.35e-02 0s 5 6.33028318e+01 -1.18216310e+02 1.82e+01 1.55e-15 2.39e-02 0s 6 4.74290404e+01 -8.28474254e+01 1.18e+01 1.39e-15 1.67e-02 0s 7 3.20954588e+01 -3.78257160e+01 6.68e+00 1.29e-15 8.86e-03 0s 8 2.47535920e+01 -1.76351315e+00 2.98e+00 1.23e-15 3.28e-03 0s 9 2.37489891e+01 1.47279504e+01 2.11e+00 1.24e-15 1.12e-03 0s 10 2.08243452e+01 1.79807421e+01 3.33e-01 1.45e-15 3.34e-04 0s 11 2.04446042e+01 1.86015675e+01 1.83e-01 1.86e-15 2.15e-04 0s 12 2.00991484e+01 1.97735228e+01 4.32e-02 1.18e-15 3.83e-05 0s 13 2.00013054e+01 1.99968951e+01 5.99e-04 9.34e-16 5.19e-07 0s 14 2.00000015e+01 1.99999969e+01 1.24e-13 1.43e-15 5.19e-10 0s 15 2.00000000e+01 2.00000000e+01 2.02e-13 1.64e-15 5.55e-16 0s Barrier solved model in 15 iterations and 0.05 seconds Optimal objective 2.00000000e+01 Root relaxation: objective 2.000000e+01, 2680 iterations, 0.08 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 20.00000 0 14 64.00000 20.00000 68.8% - 0s H 0 0 21.0000000 20.00000 4.76% - 0s H 0 0 20.0000000 20.00000 0.0% - 0s Explored 0 nodes (4455 simplex iterations) in 0.52 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 2.000000000000e+01, best bound 2.000000000000e+01, gap 0.0% Preprocessing time: 0.11 seconds Gurobi run time: 0.52 seconds Total run time: 0.63 seconds Objective: 20 Solution: 1 x [13, 17, 20, 35, 56] 1 x [2, 7, 16, 53, 55] 1 x [5, 6, 21, 52, 55] 1 x [1, 23, 36, 38, 54] 1 x [13, 15, 26, 33, 53] 1 x [4, 4, 9, 16, 53] 1 x [8, 10, 21, 48, 51] 1 x [3, 7, 37, 41, 51] 1 x [13, 17, 22, 27, 50] 1 x [5, 14, 21, 46, 49] 1 x [8, 12, 28, 43, 49] 1 x [1, 19, 25, 45, 47] 1 x [8, 15, 19, 45, 47] 1 x [15, 24, 29, 36, 44] 1 x [2, 23, 34, 42, 43] 1 x [13, 18, 23, 42, 43] 1 x [11, 29, 35, 36, 40] 1 x [18, 30, 31, 32, 39] 1 x [8, 27, 32, 32, 39] 1 x [10, 27, 31, 32, 34]