Build (method = -2) #dp: 3999 Step-3' Graph: 31 vertices and 1063 arcs (0.02s) Step-4' Graph: 31 vertices and 1063 arcs (0.02s) #V4/#V3 = 1.00 #A4/#A3 = 1.00 Ready! (0.02s) Optimize a model with 91 rows, 1064 columns and 3142 nonzeros Presolve removed 2 rows and 2 columns Presolve time: 0.01s Presolved: 89 rows, 1062 columns, 3138 nonzeros Variable types: 0 continuous, 1062 integer (97 binary) Found heuristic solution: objective 290.0000000 Found heuristic solution: objective 210.0000000 Optimize a model with 89 rows, 1062 columns and 3138 nonzeros Presolved: 89 rows, 1062 columns, 3138 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.382e+03 Factor NZ : 2.286e+03 Factor Ops : 8.495e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 7.14349816e+03 -1.45486933e+04 4.09e+03 2.93e-02 9.21e+01 0s 1 1.72172697e+03 -6.73513024e+03 4.81e+02 6.66e-16 1.31e+01 0s 2 4.69619613e+02 -2.93702372e+03 3.03e+01 2.09e-14 1.99e+00 0s 3 2.74644053e+02 -3.13632546e+02 3.34e+00 2.66e-15 2.83e-01 0s 4 2.07838515e+02 -1.12867729e+02 1.25e+00 1.11e-15 1.50e-01 0s 5 1.39535854e+02 -3.00814185e+01 6.22e-01 4.44e-16 7.88e-02 0s 6 8.49780361e+01 1.00344167e+01 2.58e-01 3.33e-16 3.47e-02 0s 7 6.92422537e+01 3.07993054e+01 1.42e-01 3.33e-16 1.77e-02 0s 8 6.37116664e+01 4.03629636e+01 9.11e-02 2.22e-16 1.07e-02 0s 9 6.03675976e+01 4.88371849e+01 4.64e-02 2.88e-16 5.29e-03 0s 10 5.82241451e+01 5.74127435e+01 3.11e-03 3.33e-16 3.71e-04 0s 11 5.79012251e+01 5.78932286e+01 1.02e-05 3.33e-16 3.67e-06 0s 12 5.79000012e+01 5.78999932e+01 2.55e-13 3.33e-16 3.67e-09 0s 13 5.79000000e+01 5.79000000e+01 2.00e-13 2.22e-16 3.67e-12 0s Barrier solved model in 13 iterations and 0.01 seconds Optimal objective 5.79000000e+01 Root relaxation: objective 5.790000e+01, 956 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 57.90000 0 14 210.00000 57.90000 72.4% - 0s H 0 0 59.0000000 57.90000 1.86% - 0s H 0 0 58.0000000 57.90000 0.17% - 0s Explored 0 nodes (1195 simplex iterations) in 0.06 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 5.800000000000e+01, best bound 5.800000000000e+01, gap 0.0% Preprocessing time: 0.03 seconds Gurobi run time: 0.06 seconds Total run time: 0.10 seconds Objective: 58 Solution: 2 x [9, 17, 34, 45, 58] 7 x [45, 48, 52] 1 x [9, 17, 34, 45, 52] 2 x [9, 17, 29, 31, 34] 4 x [26, 29, 29] 4 x [25, 33, 38, 51] 3 x [8, 25, 30, 53, 55] 1 x [2, 4, 12, 24, 25, 59] 2 x [27, 28, 32, 41, 44, 55] 1 x [4, 24, 41, 44, 46, 55, 59] 2 x [9, 20, 34, 35, 39] 5 x [1, 11, 13, 39, 43] 1 x [24, 33, 35, 43, 50, 59] 1 x [4, 11, 19, 23, 33, 40, 59] 1 x [4, 5, 22, 23, 24, 33, 46, 47, 59] 1 x [4, 13, 15, 35, 56] 2 x [9, 11, 19, 32, 35, 37, 57, 59] 2 x [4, 16, 18, 34, 36, 37, 47] 2 x [3, 5, 8, 13, 28, 53] 1 x [6, 12, 14, 22, 23, 24, 50] 3 x [12, 12, 27, 42, 56] 3 x [19, 32, 37, 49, 54, 56, 59] 4 x [10, 21, 23, 27, 40, 46, 49] 1 x [4, 14, 17, 19, 23, 24, 40, 50, 55, 60] 1 x [7, 9, 12, 14, 24, 32, 50] 1 x [1, 11, 12, 17, 27, 37, 51, 55, 55, 55]