Build (method = -2) #dp: 4071 Step-3' Graph: 218 vertices and 2030 arcs (0.02s) Step-4' Graph: 180 vertices and 1952 arcs (0.02s) #V4/#V3 = 0.83 #A4/#A3 = 0.96 Ready! (0.02s) Optimize a model with 211 rows, 1953 columns and 5503 nonzeros Presolve removed 11 rows and 16 columns Presolve time: 0.04s Presolved: 200 rows, 1937 columns, 5497 nonzeros Variable types: 0 continuous, 1937 integer (870 binary) Found heuristic solution: objective 28.0000000 Optimize a model with 200 rows, 1937 columns and 5497 nonzeros Presolved: 200 rows, 1937 columns, 5497 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 3.075e+03 Factor NZ : 8.467e+03 Factor Ops : 4.613e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.59824945e+03 -8.13465288e+03 2.00e+04 1.54e-01 1.90e+01 0s 1 4.47533509e+02 -2.84556178e+03 3.11e+03 1.55e-15 3.24e+00 0s 2 1.17427017e+02 -8.72739768e+02 4.05e+02 1.67e-15 5.22e-01 0s 3 5.49043444e+01 -1.53105538e+02 4.68e+01 1.42e-15 7.78e-02 0s 4 2.77035893e+01 -3.38874650e+01 1.00e+01 9.71e-16 1.97e-02 0s 5 1.82031359e+01 -1.87302183e+01 5.46e+00 1.67e-15 1.13e-02 0s 6 1.43884923e+01 -6.68027544e+00 3.38e+00 1.89e-15 6.26e-03 0s 7 1.24923194e+01 -1.18111294e+00 2.17e+00 1.78e-15 3.96e-03 0s 8 1.20892425e+01 5.39653385e+00 1.61e+00 1.38e-15 1.94e-03 0s 9 1.06405738e+01 8.63986966e+00 2.72e-01 1.33e-15 5.36e-04 0s 10 1.01321231e+01 9.62452210e+00 4.78e-02 1.15e-15 1.33e-04 0s 11 1.00225558e+01 9.83065547e+00 1.64e-02 1.51e-15 5.03e-05 0s 12 9.96753303e+00 9.90513278e+00 2.98e-03 1.33e-15 1.62e-05 0s 13 9.95606049e+00 9.93783948e+00 9.14e-04 9.42e-16 4.74e-06 0s 14 9.95073146e+00 9.94714619e+00 8.93e-05 1.11e-15 9.27e-07 0s 15 9.95000219e+00 9.94999443e+00 6.28e-15 9.30e-16 2.00e-09 0s 16 9.95000000e+00 9.94999999e+00 3.60e-15 1.04e-15 2.00e-12 0s Barrier solved model in 16 iterations and 0.03 seconds Optimal objective 9.95000000e+00 Root relaxation: objective 9.950000e+00, 633 iterations, 0.04 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 9.95000 0 42 28.00000 9.95000 64.5% - 0s H 0 0 11.0000000 9.95000 9.55% - 0s * 0 0 0 10.0000000 10.00000 0.0% - 0s Cutting planes: Gomory: 2 MIR: 2 Zero half: 6 Explored 0 nodes (2822 simplex iterations) in 0.36 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.04 seconds Gurobi run time: 0.36 seconds Total run time: 0.40 seconds Objective: 10 Solution: 1 x [1, 5, 6, 29, 31] 1 x [2, 7, 9, 27, 31] 1 x [2, 6, 11, 26, 31] 1 x [4, 11, 17, 17, 30] 1 x [1, 12, 13, 15, 29] 1 x [2, 7, 17, 21, 28] 1 x [4, 10, 14, 24, 25] 1 x [3, 8, 16, 23, 25] 1 x [5, 9, 14, 20, 22] 1 x [5, 16, 18, 19, 19]