Build (method = -2) #dp: 6575 Step-3' Graph: 67 vertices and 990 arcs (0.04s) Step-4' Graph: 51 vertices and 958 arcs (0.04s) #V4/#V3 = 0.76 #A4/#A3 = 0.97 Ready! (0.04s) Optimize a model with 111 rows, 959 columns and 2784 nonzeros Presolve removed 3 rows and 4 columns Presolve time: 0.01s Presolved: 108 rows, 955 columns, 2776 nonzeros Variable types: 0 continuous, 955 integer (74 binary) Found heuristic solution: objective 338.0000000 Found heuristic solution: objective 296.0000000 Optimize a model with 108 rows, 955 columns and 2776 nonzeros Presolved: 108 rows, 955 columns, 2776 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.280e+03 Factor NZ : 2.622e+03 Factor Ops : 8.237e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 7.78531297e+03 -1.27772770e+04 9.44e+03 9.66e-02 8.64e+01 0s 1 1.88550840e+03 -5.75801883e+03 1.38e+03 6.66e-16 1.42e+01 0s 2 4.22659849e+02 -2.59240751e+03 1.02e+02 1.78e-15 2.13e+00 0s 3 2.71564356e+02 -3.47138940e+02 4.70e+00 1.89e-15 3.24e-01 0s 4 1.25082082e+02 -1.15069849e+02 3.98e-01 7.77e-16 1.23e-01 0s 5 8.11044320e+01 -1.90596470e+01 1.92e-01 3.33e-16 5.11e-02 0s 6 7.00138963e+01 2.87271648e+01 1.15e-01 3.68e-16 2.11e-02 0s 7 6.48173552e+01 4.89788967e+01 5.77e-02 2.81e-16 8.07e-03 0s 8 5.93197185e+01 5.72830565e+01 1.51e-03 3.66e-16 1.04e-03 0s 9 5.86872510e+01 5.86234277e+01 1.18e-04 4.07e-16 3.25e-05 0s 10 5.86666902e+01 5.86666233e+01 4.57e-13 3.10e-16 3.41e-08 0s 11 5.86666667e+01 5.86666667e+01 1.43e-13 3.33e-16 3.69e-14 0s Barrier solved model in 11 iterations and 0.01 seconds Optimal objective 5.86666667e+01 Root relaxation: objective 5.866667e+01, 727 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 58.66667 0 30 296.00000 58.66667 80.2% - 0s H 0 0 61.0000000 58.66667 3.83% - 0s H 0 0 60.0000000 58.66667 2.22% - 0s H 0 0 59.0000000 58.66667 0.56% - 0s Explored 0 nodes (914 simplex iterations) in 0.07 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 5.900000000000e+01, best bound 5.900000000000e+01, gap 0.0% Preprocessing time: 0.06 seconds Gurobi run time: 0.07 seconds Total run time: 0.12 seconds Objective: 59 Solution: 2 x [7, 14, 25, 27, 29, 37] 4 x [10, 13, 29, 33, 34, 51] 1 x [10, 13, 18, 33, 36] 4 x [2, 9, 18, 21, 23, 53] 1 x [6, 10, 23, 33, 41, 43] 2 x [6, 15, 21, 27, 39, 54] 4 x [6, 14, 19, 26, 38, 40] 2 x [4, 8, 23, 36, 45, 60] 6 x [24, 25, 35, 42, 50, 58] 3 x [31, 32, 36, 42, 53, 54] 1 x [7, 15, 27, 31, 49] 3 x [4, 16, 27, 30, 34, 59] 1 x [5, 7, 9, 16, 27, 56] 1 x [5, 7, 9, 16, 17, 25] 1 x [1, 4, 7, 24, 24, 27] 3 x [4, 12, 49, 51, 53, 57] 2 x [8, 12, 20, 36, 55, 56] 2 x [3, 15, 26, 32, 36, 56] 1 x [17, 20, 38, 51, 52, 55] 7 x [3, 20, 22, 41, 46, 59] 2 x [11, 11, 19, 38, 39, 40] 1 x [5, 7, 23, 28, 45, 48] 3 x [5, 11, 44, 44, 47, 55] 2 x [5, 11, 44, 44, 45, 55]