Build (method = -2) #dp: 2803 Step-3' Graph: 31 vertices and 758 arcs (0.01s) Step-4' Graph: 31 vertices and 758 arcs (0.01s) #V4/#V3 = 1.00 #A4/#A3 = 1.00 Ready! (0.01s) Optimize a model with 71 rows, 759 columns and 2224 nonzeros Presolve removed 2 rows and 2 columns Presolve time: 0.01s Presolved: 69 rows, 757 columns, 2220 nonzeros Variable types: 0 continuous, 757 integer (55 binary) Found heuristic solution: objective 230.0000000 Found heuristic solution: objective 146.0000000 Optimize a model with 69 rows, 757 columns and 2220 nonzeros Presolved: 69 rows, 757 columns, 2220 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.017e+03 Factor NZ : 1.663e+03 Factor Ops : 5.559e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 5.57684878e+03 -1.01874934e+04 3.59e+03 1.05e-01 1.07e+02 0s 1 1.71112529e+03 -5.09919154e+03 6.58e+02 6.66e-16 2.07e+01 0s 2 3.30347704e+02 -2.59399978e+03 2.68e+01 4.44e-15 2.41e+00 0s 3 2.19296727e+02 -4.21276227e+02 1.76e+00 2.66e-14 4.24e-01 0s 4 1.36981448e+02 -1.07685014e+02 4.75e-01 6.88e-15 1.59e-01 0s 5 8.01992082e+01 -2.47052265e+01 1.78e-01 2.11e-15 6.80e-02 0s 6 6.67675856e+01 5.75474538e+00 1.23e-01 9.99e-16 3.95e-02 0s 7 5.29086013e+01 2.87717831e+01 5.95e-02 2.38e-16 1.56e-02 0s 8 4.90045215e+01 3.98416306e+01 2.48e-02 2.22e-16 5.91e-03 0s 9 4.75709478e+01 4.31104185e+01 1.16e-02 2.22e-16 2.88e-03 0s 10 4.64179981e+01 4.61108884e+01 2.78e-04 4.44e-16 1.98e-04 0s 11 4.63334736e+01 4.63330980e+01 3.98e-07 2.90e-16 2.42e-07 0s 12 4.63333335e+01 4.63333331e+01 1.15e-14 4.28e-16 2.42e-10 0s Barrier solved model in 12 iterations and 0.01 seconds Optimal objective 4.63333335e+01 Root relaxation: objective 4.633333e+01, 665 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 46.33333 0 34 146.00000 46.33333 68.3% - 0s H 0 0 49.0000000 46.33333 5.44% - 0s H 0 0 48.0000000 46.33333 3.47% - 0s H 0 0 47.0000000 46.33333 1.42% - 0s Explored 0 nodes (816 simplex iterations) in 0.04 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 4.700000000000e+01, best bound 4.700000000000e+01, gap 0.0% Preprocessing time: 0.02 seconds Gurobi run time: 0.04 seconds Total run time: 0.06 seconds Objective: 47 Solution: 4 x [9, 27, 37, 39] 3 x [6, 39, 39] 5 x [1, 3, 4, 15, 30] 4 x [21, 24, 29, 30, 38] 1 x [1, 6, 20, 31] 4 x [6, 13, 18, 23, 26] 2 x [5, 5, 6, 12, 13, 17, 22] 4 x [8, 14, 16, 21, 40] 2 x [2, 15, 40, 40] 1 x [1, 31, 33, 36, 36] 3 x [9, 12, 14, 16, 18] 2 x [5, 13, 14, 17, 18, 22, 23] 2 x [10, 16, 17, 19, 23, 34, 35, 36] 1 x [17, 23, 26, 28, 34, 34, 35] 1 x [8, 11, 16, 18, 23, 32, 34] 2 x [5, 11, 12, 12, 13, 22, 25, 38] 3 x [7, 7, 10, 11, 19, 36, 38] 1 x [10, 21, 28, 29, 38] 2 x [3, 3, 7, 8, 8, 28]