Build (method = -2) #dp: 5794 Step-3' Graph: 66 vertices and 1020 arcs (0.03s) Step-4' Graph: 50 vertices and 989 arcs (0.03s) #V4/#V3 = 0.76 #A4/#A3 = 0.97 Ready! (0.03s) Optimize a model with 110 rows, 990 columns and 2878 nonzeros Presolve removed 3 rows and 4 columns Presolve time: 0.01s Presolved: 107 rows, 986 columns, 2870 nonzeros Variable types: 0 continuous, 986 integer (119 binary) Found heuristic solution: objective 270.0000000 Found heuristic solution: objective 242.0000000 Optimize a model with 107 rows, 986 columns and 2870 nonzeros Presolved: 107 rows, 986 columns, 2870 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.325e+03 Factor NZ : 2.743e+03 Factor Ops : 9.104e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 5.41180880e+03 -9.96124056e+03 6.36e+03 1.18e-01 5.92e+01 0s 1 1.38990370e+03 -4.58061033e+03 9.65e+02 5.55e-16 1.02e+01 0s 2 3.79002500e+02 -1.99530837e+03 1.01e+02 2.44e-15 1.78e+00 0s 3 2.27218116e+02 -3.11568609e+02 1.49e+01 6.22e-15 3.02e-01 0s 4 1.10708141e+02 -1.21080770e+02 1.33e+00 2.44e-15 1.17e-01 0s 5 7.70553873e+01 -4.44822172e+01 6.81e-01 1.11e-15 6.07e-02 0s 6 6.91422097e+01 1.69623529e+01 5.06e-01 4.44e-16 2.60e-02 0s 7 5.72056109e+01 3.13669718e+01 2.10e-01 2.25e-16 1.28e-02 0s 8 5.32140061e+01 4.55037086e+01 9.30e-02 2.78e-16 3.81e-03 0s 9 5.10587926e+01 4.86026285e+01 4.13e-02 3.34e-16 1.21e-03 0s 10 4.93383812e+01 4.93273346e+01 2.25e-12 3.46e-16 5.46e-06 0s 11 4.93333334e+01 4.93333333e+01 2.87e-13 4.44e-16 2.90e-11 0s Barrier solved model in 11 iterations and 0.01 seconds Optimal objective 4.93333334e+01 Root relaxation: objective 4.933333e+01, 768 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 49.33333 0 26 242.00000 49.33333 79.6% - 0s H 0 0 54.0000000 49.33333 8.64% - 0s H 0 0 52.0000000 49.33333 5.13% - 0s H 0 0 50.0000000 49.33333 1.33% - 0s Explored 0 nodes (1022 simplex iterations) in 0.08 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 5.000000000000e+01, best bound 5.000000000000e+01, gap 0.0% Preprocessing time: 0.04 seconds Gurobi run time: 0.08 seconds Total run time: 0.12 seconds Objective: 50 Solution: 3 x [17, 18, 19, 34, 37, 53] 3 x [8, 21, 23, 35, 35, 53] 2 x [11, 15, 18, 25, 50, 51] 1 x [14, 21, 23, 25, 59] 3 x [5, 15, 23, 25, 40, 44] 1 x [22, 24, 41, 45] 1 x [7, 24, 41, 45] 1 x [13, 16, 24, 31, 41, 42] 1 x [6, 11, 18, 19, 38, 47] 1 x [19, 19, 37, 39, 54] 2 x [9, 43, 45, 51] 3 x [6, 9, 34, 48, 51, 57] 4 x [1, 6, 31, 32, 45, 57] 1 x [5, 13, 14, 15, 45, 58] 1 x [11, 20, 33, 45] 2 x [6, 13, 13, 32, 35, 47] 1 x [5, 23, 28, 31, 36, 58] 1 x [7, 11, 15, 33, 56, 58] 2 x [3, 12, 15, 27, 47, 58] 1 x [1, 11, 28, 29, 36, 49] 4 x [4, 10, 14, 26, 29, 39] 3 x [4, 26, 29, 31, 42, 42] 2 x [2, 4, 11, 23, 26, 30] 1 x [1, 2, 4, 11, 36] 2 x [5, 13, 44, 59, 59, 59] 1 x [32, 47, 52, 52, 55, 60] 1 x [32, 47, 47, 55, 55, 60] 1 x [1, 1, 3, 3, 35, 46]