Build (method = -2) #dp: 5172 Step-3' Graph: 66 vertices and 982 arcs (0.03s) Step-4' Graph: 50 vertices and 951 arcs (0.03s) #V4/#V3 = 0.76 #A4/#A3 = 0.97 Ready! (0.03s) Optimize a model with 110 rows, 952 columns and 2762 nonzeros Presolve removed 3 rows and 4 columns Presolve time: 0.01s Presolved: 107 rows, 948 columns, 2754 nonzeros Variable types: 0 continuous, 948 integer (54 binary) Found heuristic solution: objective 283.0000000 Found heuristic solution: objective 236.0000000 Optimize a model with 107 rows, 948 columns and 2754 nonzeros Presolved: 107 rows, 948 columns, 2754 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.283e+03 Factor NZ : 2.664e+03 Factor Ops : 8.834e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 9.05441406e+03 -1.31857749e+04 1.02e+04 1.00e-01 9.90e+01 0s 1 2.22921403e+03 -6.00390230e+03 1.53e+03 5.55e-16 1.65e+01 0s 2 5.02218208e+02 -2.66568323e+03 1.73e+02 2.44e-15 2.78e+00 0s 3 2.55078972e+02 -4.91376292e+02 7.48e+00 2.33e-15 4.04e-01 0s 4 1.55967862e+02 -1.33045993e+02 9.89e-01 7.77e-16 1.50e-01 0s 5 1.09863058e+02 -4.49590303e+01 5.65e-01 3.33e-16 8.00e-02 0s 6 7.30692057e+01 1.36295134e+01 2.50e-01 2.22e-16 3.06e-02 0s 7 6.26086188e+01 3.98663927e+01 1.25e-01 3.33e-16 1.17e-02 0s 8 5.76661284e+01 5.15197040e+01 2.99e-02 3.33e-16 3.15e-03 0s 9 5.55639882e+01 5.47346665e+01 4.78e-03 3.33e-16 4.25e-04 0s 10 5.53002980e+01 5.52978309e+01 5.89e-14 4.44e-16 1.26e-06 0s 11 5.53000000e+01 5.53000000e+01 2.26e-14 4.44e-16 1.41e-12 0s Barrier solved model in 11 iterations and 0.01 seconds Optimal objective 5.53000000e+01 Root relaxation: objective 5.530000e+01, 742 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 55.30000 0 43 236.00000 55.30000 76.6% - 0s H 0 0 56.0000000 55.30000 1.25% - 0s Explored 0 nodes (1165 simplex iterations) in 0.07 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 5.600000000000e+01, best bound 5.600000000000e+01, gap 0.0% Preprocessing time: 0.04 seconds Gurobi run time: 0.07 seconds Total run time: 0.11 seconds Objective: 56 Solution: 3 x [51, 55, 59] 3 x [41, 54, 59] 2 x [20, 25, 31, 47, 50, 59] 1 x [5, 15, 46, 52, 59] 3 x [4, 17, 23, 54] 2 x [8, 17, 20, 24, 48, 51] 4 x [8, 24, 35, 38, 51, 58] 3 x [3, 7, 26, 27, 50, 60] 3 x [20, 21, 28, 31, 41, 47] 2 x [5, 12, 15, 18, 21, 32] 1 x [5, 12, 14, 18, 23, 38] 5 x [19, 33, 35, 37, 44] 1 x [3, 6, 10, 19, 22, 53] 1 x [3, 3, 10, 19, 22, 53] 1 x [1, 9, 35, 38, 40] 2 x [6, 9, 10, 20, 38, 40] 1 x [16, 26, 27, 30, 42, 45] 1 x [13, 13, 27, 29, 30, 53] 2 x [11, 16, 26, 27, 39, 42] 4 x [11, 13, 13, 31, 36, 42] 1 x [7, 10, 11, 11, 26, 29] 2 x [6, 10, 39, 43, 45, 53] 2 x [2, 26, 27, 34, 42, 45] 4 x [25, 29, 34, 36, 56, 57] 1 x [25, 26, 34, 36, 56, 56] 1 x [31, 49, 56]