Build (method = -2) #dp: 23702 Step-3' Graph: 523 vertices and 2421 arcs (0.26s) Step-4' Graph: 298 vertices and 1996 arcs (0.27s) #V4/#V3 = 0.57 #A4/#A3 = 0.82 Ready! (0.27s) Optimize a model with 338 rows, 1997 columns and 5377 nonzeros Presolve removed 44 rows and 89 columns Presolve time: 0.04s Presolved: 294 rows, 1908 columns, 5204 nonzeros Variable types: 0 continuous, 1908 integer (170 binary) Found heuristic solution: objective 93.0000000 Optimize a model with 294 rows, 1908 columns and 5204 nonzeros Presolved: 294 rows, 1908 columns, 5204 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 3.456e+03 Factor NZ : 9.195e+03 Factor Ops : 4.268e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 6.60976745e+03 -3.38342204e+04 4.98e+04 1.68e-01 1.71e+02 0s 1 1.65049427e+03 -1.28982197e+04 9.46e+03 6.74e-14 3.27e+01 0s 2 2.67956117e+02 -5.44801458e+03 7.45e+02 4.00e-14 3.61e+00 0s 3 1.60404968e+02 -2.08224669e+03 7.66e+01 3.89e-14 7.37e-01 0s 4 1.26691628e+02 -4.06122656e+02 5.98e+00 4.46e-14 1.44e-01 0s 5 9.87675495e+01 -1.59536332e+02 3.54e+00 6.20e-14 6.93e-02 0s 6 8.83040347e+01 -1.24479616e+02 2.72e+00 4.42e-14 5.68e-02 0s 7 6.67343225e+01 -8.80387571e+01 2.01e+00 4.55e-14 4.12e-02 0s 8 2.99051252e+01 -2.04668975e+01 6.30e-01 4.80e-14 1.33e-02 0s 9 1.60298464e+01 -2.85311563e+00 2.11e-01 3.72e-14 4.97e-03 0s 10 1.48594064e+01 7.57912850e+00 1.25e-01 4.14e-14 1.92e-03 0s 11 1.39165058e+01 1.07616899e+01 8.23e-02 4.41e-14 8.31e-04 0s 12 1.25333916e+01 1.23638943e+01 1.23e-03 4.58e-14 4.42e-05 0s 13 1.25000022e+01 1.24999680e+01 6.54e-14 3.74e-14 8.88e-09 0s 14 1.25000000e+01 1.25000000e+01 2.05e-13 4.37e-14 1.16e-14 0s Barrier solved model in 14 iterations and 0.02 seconds Optimal objective 1.25000000e+01 Root relaxation: objective 1.250000e+01, 1400 iterations, 0.04 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 12.50000 0 35 93.00000 12.50000 86.6% - 0s H 0 0 15.0000000 12.50000 16.7% - 0s H 0 0 14.0000000 12.50000 10.7% - 0s H 0 0 13.0000000 12.50000 3.85% - 0s Explored 0 nodes (2369 simplex iterations) in 0.24 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.300000000000e+01, best bound 1.300000000000e+01, gap 0.0% Preprocessing time: 0.28 seconds Gurobi run time: 0.24 seconds Total run time: 0.52 seconds Objective: 13 Solution: 2 x [2, 3, 5, 11, 17, 29, 36, 40] 1 x [5, 10, 19, 28, 33, 36, 37, 40] 1 x [1, 2, 4, 6, 18, 26, 35] 1 x [1, 6, 18, 25, 31, 35] 1 x [1, 6, 7, 8, 21, 22, 24, 35] 1 x [6, 12, 26, 27, 32, 34, 35, 39] 1 x [13, 15, 23, 30, 30, 33, 38] 1 x [13, 15, 23, 30, 30, 30, 33, 38] 1 x [9, 9, 9, 23, 25, 29, 31, 37] 2 x [13, 14, 19, 20, 21, 22, 32, 34] 1 x [8, 8, 8, 10, 16, 16, 16, 25]