Build (method = -2) #dp: 69068 Step-3' Graph: 607 vertices and 4750 arcs (0.60s) Step-4' Graph: 358 vertices and 4269 arcs (0.61s) #V4/#V3 = 0.59 #A4/#A3 = 0.90 Ready! (0.61s) Optimize a model with 422 rows, 4270 columns and 12082 nonzeros Presolve removed 25 rows and 41 columns Presolve time: 0.06s Presolved: 397 rows, 4229 columns, 12039 nonzeros Variable types: 0 continuous, 4229 integer (1901 binary) Found heuristic solution: objective 58.0000000 Optimize a model with 397 rows, 4229 columns and 12039 nonzeros Presolved: 397 rows, 4229 columns, 12039 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 8.030e+03 Factor NZ : 2.200e+04 (roughly 2 MBytes of memory) Factor Ops : 1.820e+06 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.55049436e+04 -5.90246583e+04 6.60e+04 2.06e-01 1.00e+02 0s 1 3.23177966e+03 -1.36184046e+04 1.42e+04 7.77e-16 2.12e+01 0s 2 4.62761825e+02 -5.40113357e+03 1.15e+03 6.66e-16 2.18e+00 0s 3 2.05592390e+02 -1.76896022e+03 1.29e+02 9.99e-16 3.67e-01 0s 4 1.29558508e+02 -4.10544020e+02 2.58e+01 9.99e-16 8.42e-02 0s 5 8.61564100e+01 -1.79283873e+02 9.17e+00 6.66e-16 3.70e-02 0s 6 6.01438145e+01 -9.46860220e+01 5.25e+00 3.36e-16 2.09e-02 0s 7 4.22855563e+01 -5.79384018e+01 3.25e+00 2.57e-16 1.32e-02 0s 8 2.67893971e+01 -2.93783785e+01 1.63e+00 2.24e-16 7.21e-03 0s 9 1.84458014e+01 -2.42324220e+00 6.48e-01 3.33e-16 2.62e-03 0s 10 1.62430754e+01 1.89041631e+00 4.05e-01 2.22e-16 1.77e-03 0s 11 1.56612052e+01 5.32809869e+00 2.92e-01 3.33e-16 1.27e-03 0s 12 1.53158051e+01 9.71468174e+00 2.19e-01 2.22e-16 6.83e-04 0s 13 1.48881133e+01 1.25775251e+01 3.35e-02 2.65e-16 2.74e-04 0s 14 1.43143538e+01 1.41244127e+01 3.32e-03 2.93e-16 2.25e-05 0s 15 1.42857784e+01 1.42850839e+01 1.15e-12 2.22e-16 8.18e-08 0s 16 1.42857143e+01 1.42857137e+01 1.70e-12 2.22e-16 8.18e-11 0s 17 1.42857143e+01 1.42857143e+01 5.05e-13 3.33e-16 9.46e-17 0s Barrier solved model in 17 iterations and 0.07 seconds Optimal objective 1.42857143e+01 Root relaxation: objective 1.428571e+01, 3505 iterations, 0.11 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 14.28571 0 15 58.00000 14.28571 75.4% - 0s H 0 0 15.0000000 14.28571 4.76% - 0s Explored 0 nodes (5612 simplex iterations) in 0.57 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.500000000000e+01, best bound 1.500000000000e+01, gap 0.0% Preprocessing time: 0.63 seconds Gurobi run time: 0.57 seconds Total run time: 1.20 seconds Objective: 15 Solution: 1 x [2, 9, 23, 24, 37, 40, 60] 1 x [17, 20, 22, 35, 48, 57, 62] 1 x [6, 6, 7, 10, 22, 26, 29] 1 x [11, 18, 21, 25, 25, 44, 50] 1 x [3, 11, 13, 15, 20, 33, 53] 1 x [20, 36, 47, 49, 55, 58, 59] 1 x [5, 19, 26, 44, 46, 50, 63] 1 x [6, 7, 10, 12, 12, 16, 27] 1 x [14, 36, 38, 51, 58, 60] 1 x [5, 8, 28, 39, 50, 52, 61] 2 x [4, 30, 33, 34, 42, 45, 50] 1 x [1, 31, 31, 40, 41, 49, 56] 1 x [32, 38, 43, 54, 60, 61, 64] 1 x [46, 47, 47]