Build (method = -2) #dp: 28024 Step-3' Graph: 537 vertices and 1598 arcs (0.23s) Step-4' Graph: 212 vertices and 948 arcs (0.24s) #V4/#V3 = 0.39 #A4/#A3 = 0.59 Ready! (0.24s) Optimize a model with 255 rows, 949 columns and 2433 nonzeros Presolve removed 61 rows and 120 columns Presolve time: 0.01s Presolved: 194 rows, 829 columns, 2206 nonzeros Variable types: 0 continuous, 829 integer (0 binary) Found heuristic solution: objective 192.0000000 Found heuristic solution: objective 176.0000000 Optimize a model with 194 rows, 829 columns and 2206 nonzeros Presolved: 194 rows, 829 columns, 2206 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.077e+03 Factor NZ : 2.507e+03 Factor Ops : 3.551e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 5.89657807e+02 -2.75526715e+03 1.34e+03 2.22e-16 7.19e+00 0s 1 1.73167895e+02 -1.33659525e+03 1.02e+02 3.89e-16 1.20e+00 0s 2 1.03585464e+02 -2.12433275e+02 1.64e+00 3.33e-16 1.89e-01 0s 3 3.89399550e+01 -3.18268001e+01 1.49e-01 2.91e-16 4.18e-02 0s 4 3.14931081e+01 1.61153415e+01 5.34e-02 2.54e-16 9.06e-03 0s 5 2.90140027e+01 2.74639516e+01 1.89e-03 2.32e-16 9.12e-04 0s 6 2.85739567e+01 2.85580305e+01 6.84e-06 2.69e-16 9.36e-06 0s 7 2.85714286e+01 2.85714286e+01 6.95e-12 4.44e-16 1.09e-11 0s Barrier solved model in 7 iterations and 0.01 seconds Optimal objective 2.85714286e+01 Root relaxation: objective 2.857143e+01, 567 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 28.57143 0 27 176.00000 28.57143 83.8% - 0s H 0 0 31.0000000 28.57143 7.83% - 0s H 0 0 30.0000000 28.57143 4.76% - 0s 0 0 28.57143 0 21 30.00000 28.57143 4.76% - 0s H 0 0 29.0000000 28.57143 1.48% - 0s Cutting planes: Gomory: 2 Explored 0 nodes (850 simplex iterations) in 0.07 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 2.900000000000e+01, best bound 2.900000000000e+01, gap 0.0% Preprocessing time: 0.25 seconds Gurobi run time: 0.07 seconds Total run time: 0.31 seconds Objective: 29 Solution: 2 x [1, 4, 5, 7, 35, 37, 41] 1 x [5, 11, 15, 22, 25, 29, 39] 1 x [4, 6, 11, 22, 25, 27, 38] 2 x [3, 17, 27, 30, 30, 32, 36] 5 x [2, 9, 12, 29, 35, 37, 41] 1 x [2, 17, 21, 21, 21, 21, 31] 3 x [1, 6, 14, 26, 34, 35, 43] 1 x [11, 25, 28, 28, 31, 31, 42] 1 x [17, 18, 25, 28, 42, 42] 1 x [17, 18, 18, 25, 28, 42, 42] 2 x [12, 20, 23, 33, 38, 39, 40] 3 x [6, 10, 20, 26, 33, 36, 39] 2 x [13, 13, 14, 19, 20, 32, 39] 1 x [15, 15, 16, 16, 16, 20, 33] 1 x [10, 11, 22, 25, 27, 30] 1 x [8, 11, 24, 25, 27, 28] 1 x [8, 8, 8, 11, 24, 25, 27]