Build (method = -2) #dp: 114629 Step-3' Graph: 954 vertices and 17570 arcs (1.04s) Step-4' Graph: 791 vertices and 17249 arcs (1.05s) #V4/#V3 = 0.83 #A4/#A3 = 0.98 Ready! (1.05s) Optimize a model with 878 rows, 17250 columns and 50167 nonzeros Presolve removed 30 rows and 31 columns Presolve time: 0.38s Presolved: 848 rows, 17219 columns, 50189 nonzeros Variable types: 0 continuous, 17219 integer (14159 binary) Found heuristic solution: objective 85.0000000 Optimize a model with 848 rows, 17219 columns and 50189 nonzeros Presolved: 848 rows, 17219 columns, 50189 nonzeros Root barrier log... Ordering time: 0.03s Barrier statistics: AA' NZ : 3.538e+04 Factor NZ : 1.104e+05 (roughly 8 MBytes of memory) Factor Ops : 1.990e+07 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 8.96687614e+03 -1.46922134e+05 1.07e+05 1.11e-01 2.30e+01 0s 1 2.58149747e+03 -3.38271161e+04 3.06e+04 6.66e-16 6.18e+00 0s 2 8.16576335e+02 -9.73476129e+03 5.23e+03 2.44e-15 1.15e+00 0s 3 3.03207468e+02 -4.59905000e+03 8.57e+02 1.78e-15 2.82e-01 0s 4 1.44984163e+02 -9.05854859e+02 1.64e+02 6.70e-16 5.69e-02 0s 5 8.40307996e+01 -3.03184095e+02 5.90e+01 5.55e-16 2.04e-02 0s 6 4.72453803e+01 -1.49939812e+02 1.89e+01 9.09e-16 8.45e-03 0s 7 3.13386686e+01 -8.11517922e+01 7.68e+00 6.80e-16 4.23e-03 0s 8 2.40894216e+01 -4.42447606e+01 4.14e+00 6.78e-16 2.42e-03 0s 9 2.03400566e+01 -2.36091505e+01 2.60e+00 7.81e-16 1.50e-03 0s 10 1.87187776e+01 -1.18480000e+01 1.77e+00 7.79e-16 1.01e-03 0s 11 1.78980313e+01 -3.32437045e-01 9.42e-01 5.80e-16 5.76e-04 0s 12 1.78983827e+01 2.88765411e+00 9.25e-01 6.17e-16 4.75e-04 0s 13 1.69974468e+01 1.38249245e+01 1.62e-01 5.54e-16 9.51e-05 0s 14 1.66730902e+01 1.66136399e+01 2.63e-13 5.18e-16 1.73e-06 0s 15 1.66666668e+01 1.66666644e+01 1.08e-12 7.20e-16 6.99e-11 0s 16 1.66666667e+01 1.66666667e+01 1.14e-13 6.38e-16 8.11e-17 0s Barrier solved model in 16 iterations and 0.46 seconds Optimal objective 1.66666667e+01 Root relaxation: objective 1.666667e+01, 14242 iterations, 0.69 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 16.66667 0 80 85.00000 16.66667 80.4% - 3s H 0 0 18.0000000 16.66667 7.41% - 3s 0 0 16.66667 0 171 18.00000 16.66667 7.41% - 5s H 0 0 17.0000000 16.66667 1.96% - 5s Cutting planes: Zero half: 2 Explored 0 nodes (21736 simplex iterations) in 5.40 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.700000000000e+01, best bound 1.700000000000e+01, gap 0.0% Preprocessing time: 1.11 seconds Gurobi run time: 5.40 seconds Total run time: 6.51 seconds Objective: 17 Solution: 1 x [23, 49, 54, 55, 87] 1 x [6, 20, 25, 34, 80, 86] 1 x [5, 19, 36, 63, 77, 85] 1 x [15, 42, 46, 48, 74, 84] 1 x [1, 28, 47, 75, 81, 83] 1 x [3, 41, 50, 60, 76, 82] 1 x [2, 31, 33, 72, 75, 79] 1 x [12, 37, 39, 69, 70, 78] 1 x [7, 40, 52, 58, 74, 76] 1 x [4, 11, 45, 67, 73] 1 x [16, 26, 38, 59, 61, 73] 1 x [9, 18, 22, 64, 65, 71] 1 x [8, 30, 43, 68, 69, 69] 1 x [10, 32, 41, 57, 58, 66] 1 x [15, 24, 27, 51, 56, 62] 1 x [12, 13, 17, 32, 35, 53] 1 x [14, 20, 21, 23, 29, 44]