Build (method = -2) #dp: 9348 Step-3' Graph: 302 vertices and 4208 arcs (0.07s) Step-4' Graph: 214 vertices and 3908 arcs (0.07s) #V4/#V3 = 0.71 #A4/#A3 = 0.93 Ready! (0.07s) Optimize a model with 262 rows, 3909 columns and 11305 nonzeros Presolve removed 9 rows and 12 columns Presolve time: 0.05s Presolved: 253 rows, 3897 columns, 11298 nonzeros Variable types: 0 continuous, 3897 integer (978 binary) Found heuristic solution: objective 83.0000000 Found heuristic solution: objective 76.0000000 Optimize a model with 253 rows, 3897 columns and 11298 nonzeros Presolved: 253 rows, 3897 columns, 11298 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 6.322e+03 Factor NZ : 1.510e+04 (roughly 2 MBytes of memory) Factor Ops : 1.193e+06 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 9.55901480e+03 -4.81785024e+04 5.97e+04 2.04e-01 7.32e+01 0s 1 2.45040337e+03 -1.15915443e+04 1.20e+04 6.66e-16 1.46e+01 0s 2 5.59600071e+02 -5.58850030e+03 1.60e+03 6.22e-15 2.39e+00 0s 3 3.02337753e+02 -1.91658038e+03 2.38e+02 7.11e-15 4.64e-01 0s 4 1.66270328e+02 -3.01315688e+02 3.13e+01 8.88e-16 7.54e-02 0s 5 1.16867522e+02 -1.36000263e+02 1.87e+01 6.66e-16 3.99e-02 0s 6 1.05560781e+02 -1.17021049e+02 1.58e+01 3.31e-16 3.45e-02 0s 7 9.53197434e+01 -1.07285629e+02 1.43e+01 4.44e-16 3.13e-02 0s 8 6.25513484e+01 -6.67393696e+01 7.81e+00 4.30e-16 1.92e-02 0s 9 4.69069026e+01 -2.94660811e+01 5.20e+00 3.74e-16 1.13e-02 0s 10 3.64544389e+01 -1.87635698e+01 3.57e+00 3.33e-16 8.03e-03 0s 11 2.82900319e+01 -6.38064568e+00 1.79e+00 3.33e-16 4.83e-03 0s 12 2.58147109e+01 8.52312390e+00 1.17e+00 2.81e-16 2.38e-03 0s 13 2.44519639e+01 1.42972729e+01 8.59e-01 4.44e-16 1.39e-03 0s 14 2.32836083e+01 1.78156003e+01 5.21e-01 3.33e-16 7.34e-04 0s 15 2.21760808e+01 1.92306965e+01 2.73e-01 2.84e-16 3.90e-04 0s 16 2.13376573e+01 2.00570075e+01 9.22e-02 2.22e-16 1.67e-04 0s 17 2.10127049e+01 2.04886704e+01 3.18e-02 2.28e-16 6.81e-05 0s 18 2.08612689e+01 2.06970709e+01 7.50e-03 3.33e-16 2.12e-05 0s 19 2.08169198e+01 2.07882898e+01 1.62e-03 2.22e-16 3.71e-06 0s 20 2.08018591e+01 2.07999385e+01 1.97e-05 2.22e-16 2.46e-07 0s 21 2.08015827e+01 2.08014704e+01 1.06e-06 3.52e-16 1.44e-08 0s 22 2.08015626e+01 2.08015619e+01 6.62e-12 5.55e-16 8.83e-11 0s 23 2.08015625e+01 2.08015625e+01 5.42e-13 3.53e-16 1.06e-16 0s Barrier solved model in 23 iterations and 0.08 seconds Optimal objective 2.08015625e+01 Root relaxation: objective 2.080156e+01, 1496 iterations, 0.10 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 20.80156 0 63 76.00000 20.80156 72.6% - 0s H 0 0 30.0000000 20.80156 30.7% - 0s H 0 0 23.0000000 20.80156 9.56% - 0s H 0 0 22.0000000 20.80156 5.45% - 0s 0 0 20.83333 0 82 22.00000 20.83333 5.30% - 0s H 0 0 21.0000000 20.83333 0.79% - 0s Cutting planes: Gomory: 1 Zero half: 1 Explored 0 nodes (3677 simplex iterations) in 0.68 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 2.100000000000e+01, best bound 2.100000000000e+01, gap 0.0% Preprocessing time: 0.09 seconds Gurobi run time: 0.68 seconds Total run time: 0.76 seconds Objective: 21 Solution: 1 x [28, 41, 42, 46, 48] 1 x [36, 41, 44, 46, 47] 1 x [37, 42, 43, 45, 47] 1 x [41, 42, 43, 44, 47] 1 x [30, 41, 44, 45, 46] 1 x [1, 5, 11, 40, 43] 1 x [1, 4, 6, 26, 27, 39] 1 x [2, 12, 12, 17, 23, 38] 1 x [7, 10, 12, 17, 17, 38] 1 x [1, 5, 7, 21, 34, 35] 1 x [2, 7, 7, 18, 34, 35] 1 x [3, 7, 7, 23, 28, 35] 1 x [5, 8, 13, 21, 23, 33] 1 x [3, 4, 10, 23, 31, 32] 1 x [7, 9, 16, 18, 23, 29] 1 x [5, 5, 7, 28, 29, 29] 2 x [6, 7, 13, 23, 27, 27] 1 x [9, 11, 12, 22, 24, 25] 2 x [10, 14, 15, 19, 20, 25]