Build (method = -2) #dp: 6816 Step-3' Graph: 514 vertices and 1535 arcs (0.06s) Step-4' Graph: 383 vertices and 1273 arcs (0.06s) #V4/#V3 = 0.75 #A4/#A3 = 0.83 Ready! (0.06s) Optimize a model with 423 rows, 1274 columns and 3060 nonzeros Presolve removed 11 rows and 14 columns Presolve time: 0.02s Presolved: 412 rows, 1260 columns, 3036 nonzeros Variable types: 0 continuous, 1260 integer (80 binary) Optimize a model with 412 rows, 1260 columns and 3036 nonzeros Presolved: 412 rows, 1260 columns, 3036 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 2.174e+03 Factor NZ : 9.251e+03 Factor Ops : 2.449e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 4.20827818e+03 -2.85412456e+04 4.52e+04 2.57e-01 9.63e+01 0s 1 1.16413196e+03 -1.60005377e+04 8.15e+03 1.74e-02 1.94e+01 0s 2 3.57844809e+02 -4.48402733e+03 1.47e+03 2.00e-15 3.62e+00 0s 3 1.98032645e+02 -1.01227598e+03 3.13e+02 9.99e-16 7.65e-01 0s 4 1.40368161e+02 -2.21093215e+02 5.87e+01 2.78e-15 1.77e-01 0s 5 1.25752604e+02 -1.27387547e+02 3.83e+01 1.89e-15 1.17e-01 0s 6 1.10502857e+02 -7.92827813e+01 2.22e+01 1.24e-15 8.34e-02 0s 7 9.29464593e+01 -3.32540990e+01 1.61e+01 8.88e-16 5.51e-02 0s 8 6.36052326e+01 -7.42445419e+00 4.96e+00 7.88e-16 2.94e-02 0s 9 5.40634225e+01 2.14790628e+01 1.34e+00 6.84e-16 1.31e-02 0s 10 4.57107189e+01 3.16654917e+01 4.84e-01 5.21e-16 5.62e-03 0s 11 4.38430448e+01 3.75628608e+01 2.88e-01 6.09e-16 2.52e-03 0s 12 4.23709227e+01 3.93159710e+01 1.13e-01 6.99e-16 1.22e-03 0s 13 4.22623746e+01 4.06215534e+01 9.15e-02 5.90e-16 6.61e-04 0s 14 4.15951910e+01 4.15250703e+01 2.18e-03 5.55e-16 2.80e-05 0s 15 4.15670480e+01 4.15659721e+01 1.98e-05 6.12e-16 4.28e-07 0s 16 4.15666671e+01 4.15666660e+01 1.25e-13 7.77e-16 4.28e-10 0s 17 4.15666667e+01 4.15666667e+01 5.15e-14 7.77e-16 6.25e-16 0s Barrier solved model in 17 iterations and 0.02 seconds Optimal objective 4.15666667e+01 Root relaxation: objective 4.156667e+01, 511 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 41.56667 0 93 - 41.56667 - - 0s H 0 0 72.0000000 41.56667 42.3% - 0s H 0 0 43.0000000 41.56667 3.33% - 0s 0 0 41.56667 0 202 43.00000 41.56667 3.33% - 0s H 0 0 42.0000000 41.56667 1.03% - 0s Cutting planes: Zero half: 1 Explored 0 nodes (1222 simplex iterations) in 0.29 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 4.200000000000e+01, best bound 4.200000000000e+01, gap 0.0% Preprocessing time: 0.08 seconds Gurobi run time: 0.29 seconds Total run time: 0.37 seconds Objective: 42 Solution: 2 x [12, 15, 23] 3 x [12, 16, 18, 29] 1 x [12, 33, 34, 38] 2 x [12, 26, 30, 36] 1 x [2, 3, 5, 12, 14, 21, 34] 3 x [3, 15, 29, 36] 2 x [3, 4, 15, 32] 1 x [4, 14, 23, 29] 5 x [1, 23, 28, 35] 2 x [7, 23, 33, 34, 35] 1 x [9, 17, 19, 24, 29, 34, 38] 1 x [4, 16, 20, 33] 2 x [30, 31, 33, 36] 2 x [19, 27, 31, 33, 34] 1 x [19, 20, 28, 34, 36] 2 x [7, 16, 20, 21, 26] 2 x [6, 19, 20, 25, 27, 39] 1 x [17, 19, 20, 22, 24, 30] 2 x [13, 21, 28, 36, 37] 1 x [6, 16, 27, 28, 30] 1 x [3, 6, 8, 10, 11, 37] 1 x [3, 11, 13, 18, 24, 34, 35, 38] 2 x [10, 13, 17, 18, 19, 24, 25, 37] 1 x [10, 14, 17, 22, 25, 38, 39, 40]