Build (method = -2) #dp: 794 Step-3' Graph: 46 vertices and 282 arcs (0.00s) Step-4' Graph: 30 vertices and 250 arcs (0.00s) #V4/#V3 = 0.65 #A4/#A3 = 0.89 Ready! (0.00s) Optimize a model with 65 rows, 251 columns and 697 nonzeros Presolve removed 20 rows and 26 columns Presolve time: 0.00s Presolved: 45 rows, 225 columns, 617 nonzeros Variable types: 0 continuous, 225 integer (120 binary) Found heuristic solution: objective 34.0000000 Optimize a model with 45 rows, 225 columns and 617 nonzeros Presolved: 45 rows, 225 columns, 617 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 3.250e+02 Factor NZ : 7.510e+02 Factor Ops : 1.495e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 3.04160303e+02 -1.07087470e+03 9.91e+02 2.03e-01 1.70e+01 0s 1 1.17483837e+02 -3.50425181e+02 1.61e+02 3.33e-15 2.97e+00 0s 2 4.62773274e+01 -7.46856435e+01 1.00e+01 2.33e-15 3.53e-01 0s 3 3.20320616e+01 2.38814502e+00 9.86e-02 1.89e-15 6.51e-02 0s 4 2.77757978e+01 1.40626868e+01 1.65e-02 2.78e-15 3.00e-02 0s 5 2.49224136e+01 2.06459154e+01 3.89e-03 1.96e-15 9.34e-03 0s 6 2.42819005e+01 2.28914747e+01 1.11e-03 2.91e-15 3.04e-03 0s 7 2.40353144e+01 2.36008322e+01 3.37e-04 1.78e-15 9.49e-04 0s 8 2.38706186e+01 2.38249620e+01 1.58e-05 2.89e-15 9.97e-05 0s 9 2.38557141e+01 2.38453615e+01 2.93e-06 3.55e-15 2.26e-05 0s 10 2.38529955e+01 2.38529068e+01 1.09e-08 1.94e-15 1.94e-07 0s 11 2.38529412e+01 2.38529412e+01 1.89e-13 2.55e-15 2.51e-12 0s Barrier solved model in 11 iterations and 0.00 seconds Optimal objective 2.38529412e+01 Root relaxation: objective 2.385294e+01, 45 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 23.85294 0 17 34.00000 23.85294 29.8% - 0s H 0 0 25.0000000 23.85294 4.59% - 0s H 0 0 24.0000000 23.85294 0.61% - 0s Explored 0 nodes (72 simplex iterations) in 0.02 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 2.400000000000e+01, best bound 2.400000000000e+01, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.02 seconds Total run time: 0.03 seconds Objective: 24 Solution: 1 x [35] 2 x [2, 34] 1 x [3, 33] 1 x [4, 32] 2 x [7, 31] 1 x [6, 30] 1 x [9, 29] 1 x [8, 29] 1 x [11, 28] 2 x [11, 27] 1 x [13, 26] 1 x [14, 25] 1 x [14, 24] 1 x [12, 23] 1 x [15, 22] 1 x [1, 5, 21] 1 x [17, 20] 1 x [19, 19] 1 x [18, 18] 1 x [2, 12, 16] 1 x [8, 10, 14]