Build (method = -2) #dp: 5893 Step-3' Graph: 251 vertices and 2803 arcs (0.04s) Step-4' Graph: 185 vertices and 2670 arcs (0.04s) #V4/#V3 = 0.74 #A4/#A3 = 0.95 Ready! (0.04s) Optimize a model with 225 rows, 2671 columns and 7644 nonzeros Presolve removed 18 rows and 21 columns Presolve time: 0.06s Presolved: 207 rows, 2650 columns, 7647 nonzeros Variable types: 0 continuous, 2650 integer (1797 binary) Found heuristic solution: objective 39.0000000 Optimize a model with 207 rows, 2650 columns and 7647 nonzeros Presolved: 207 rows, 2650 columns, 7647 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 4.298e+03 Factor NZ : 1.062e+04 (roughly 1 MByte of memory) Factor Ops : 6.970e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 3.65999064e+03 -1.31626478e+04 3.13e+04 1.80e-01 2.02e+01 0s 1 7.85495647e+02 -4.09357290e+03 4.64e+03 5.55e-16 3.32e+00 0s 2 1.78886968e+02 -9.36966821e+02 5.48e+02 5.00e-16 4.70e-01 0s 3 6.46529623e+01 -2.15221855e+02 5.86e+01 4.44e-16 7.78e-02 0s 4 3.01596927e+01 -6.06639339e+01 7.47e+00 3.35e-16 1.96e-02 0s 5 2.05485323e+01 -3.02358638e+01 3.76e+00 2.37e-16 1.05e-02 0s 6 1.78423539e+01 -1.46236861e+01 2.84e+00 3.29e-16 6.66e-03 0s 7 1.51809176e+01 -4.56155558e+00 1.96e+00 3.33e-16 4.01e-03 0s 8 1.19675386e+01 1.28069057e+00 8.71e-01 2.22e-16 2.11e-03 0s 9 1.07063932e+01 7.40402862e+00 1.63e-01 2.35e-16 6.31e-04 0s 10 1.02716745e+01 9.02398023e+00 5.97e-02 2.56e-16 2.38e-04 0s 11 1.01008040e+01 9.70548493e+00 2.41e-02 2.67e-16 7.55e-05 0s 12 1.00324633e+01 9.97044729e+00 7.46e-03 2.74e-16 1.20e-05 0s 13 1.00001937e+01 9.99974918e+00 4.93e-05 3.33e-16 8.60e-08 0s 14 1.00000000e+01 1.00000000e+01 6.07e-11 2.30e-16 9.68e-14 0s Barrier solved model in 14 iterations and 0.03 seconds Optimal objective 1.00000000e+01 Root relaxation: objective 1.000000e+01, 1439 iterations, 0.05 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 10.00000 0 21 39.00000 10.00000 74.4% - 0s H 0 0 13.0000000 10.00000 23.1% - 0s H 0 0 11.0000000 10.00000 9.09% - 0s * 0 0 0 10.0000000 10.00000 0.0% - 0s Cutting planes: Gomory: 2 MIR: 2 Zero half: 4 Explored 0 nodes (3163 simplex iterations) in 0.35 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.000000000000e+01, best bound 1.000000000000e+01, gap 0.0% Preprocessing time: 0.06 seconds Gurobi run time: 0.35 seconds Total run time: 0.40 seconds Objective: 10 Solution: 1 x [9, 10, 20, 20, 40] 1 x [3, 8, 13, 37, 39] 1 x [7, 14, 18, 24, 38] 1 x [4, 5, 15, 33, 36] 1 x [1, 17, 21, 26, 35] 1 x [2, 6, 16, 32, 34] 1 x [4, 4, 25, 31, 32] 1 x [3, 19, 22, 29, 30] 1 x [6, 12, 27, 28, 28] 1 x [6, 11, 23, 23, 24]