Build (method = -2) #dp: 91333 Step-3' Graph: 660 vertices and 3767 arcs (0.97s) Step-4' Graph: 348 vertices and 3152 arcs (0.97s) #V4/#V3 = 0.53 #A4/#A3 = 0.84 Ready! (0.97s) Optimize a model with 419 rows, 3153 columns and 8758 nonzeros Presolve removed 32 rows and 53 columns Presolve time: 0.05s Presolved: 387 rows, 3100 columns, 8686 nonzeros Variable types: 0 continuous, 3100 integer (1554 binary) Found heuristic solution: objective 53.0000000 Found heuristic solution: objective 51.0000000 Optimize a model with 387 rows, 3100 columns and 8686 nonzeros Presolved: 387 rows, 3100 columns, 8686 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 5.989e+03 Factor NZ : 1.778e+04 (roughly 2 MBytes of memory) Factor Ops : 1.284e+06 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.08484606e+04 -4.85207648e+04 4.39e+04 1.86e-01 7.64e+01 0s 1 2.98294225e+03 -1.15402098e+04 9.85e+03 6.66e-16 1.67e+01 0s 2 3.83966010e+02 -3.39546017e+03 9.43e+02 6.66e-16 1.93e+00 0s 3 1.42070780e+02 -1.03070609e+03 1.20e+02 8.88e-16 3.25e-01 0s 4 8.48023719e+01 -2.21039066e+02 1.83e+01 1.11e-15 6.50e-02 0s 5 5.23534608e+01 -8.80779079e+01 5.89e+00 3.16e-16 2.65e-02 0s 6 3.28283812e+01 -4.54644820e+01 2.58e+00 3.33e-16 1.39e-02 0s 7 2.72483905e+01 -2.75193481e+01 1.91e+00 3.33e-16 9.62e-03 0s 8 1.86139428e+01 -8.13593982e+00 6.84e-01 2.75e-16 4.51e-03 0s 9 1.68631628e+01 2.77970502e+00 4.20e-01 3.24e-16 2.35e-03 0s 10 1.51963859e+01 8.36524676e+00 2.15e-01 3.21e-16 1.13e-03 0s 11 1.48494522e+01 1.20142870e+01 1.44e-01 3.27e-16 4.67e-04 0s 12 1.43339606e+01 1.41566430e+01 7.89e-05 3.33e-16 2.85e-05 0s 13 1.42857679e+01 1.42852979e+01 2.14e-07 3.60e-16 7.55e-08 0s 14 1.42857143e+01 1.42857139e+01 1.28e-13 2.99e-16 7.55e-11 0s 15 1.42857143e+01 1.42857143e+01 7.41e-13 2.93e-16 7.55e-14 0s Barrier solved model in 15 iterations and 0.06 seconds Optimal objective 1.42857143e+01 Root relaxation: objective 1.428571e+01, 2463 iterations, 0.09 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 14.28571 0 47 51.00000 14.28571 72.0% - 0s H 0 0 17.0000000 14.28571 16.0% - 0s H 0 0 16.0000000 14.28571 10.7% - 0s H 0 0 15.0000000 14.28571 4.76% - 0s Explored 0 nodes (4045 simplex iterations) in 0.41 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: 1.00 seconds Gurobi run time: 0.41 seconds Total run time: 1.41 seconds Objective: 15 Solution: 1 x [18, 39, 39, 51, 59, 68, 71] 1 x [12, 17, 19, 20, 38, 65] 1 x [5, 14, 16, 21, 65] 1 x [1, 3, 16, 49, 52, 62, 67] 1 x [7, 15, 15, 22, 48, 56] 1 x [6, 9, 13, 32, 34, 37, 69] 1 x [2, 11, 27, 28, 31, 61, 66] 1 x [11, 40, 46, 55, 57, 60, 69] 1 x [10, 24, 26, 47, 58, 70] 1 x [9, 38, 42, 48, 50, 53, 63] 2 x [8, 25, 29, 30, 33, 35, 44] 1 x [4, 38, 41, 43, 45, 56, 61] 1 x [23, 23, 36, 47, 54, 54, 70] 1 x [36, 47, 48, 64, 64, 66, 69]