Build (method = -2) #dp: 1274 Step-3' Graph: 78 vertices and 671 arcs (0.00s) Step-4' Graph: 71 vertices and 657 arcs (0.00s) #V4/#V3 = 0.91 #A4/#A3 = 0.98 Ready! (0.00s) Optimize a model with 109 rows, 658 columns and 1836 nonzeros Presolve removed 30 rows and 34 columns Presolve time: 0.02s Presolved: 79 rows, 624 columns, 1782 nonzeros Variable types: 0 continuous, 624 integer (388 binary) Found heuristic solution: objective 35.0000000 Found heuristic solution: objective 34.0000000 Found heuristic solution: objective 32.0000000 Optimize a model with 79 rows, 624 columns and 1782 nonzeros Presolved: 79 rows, 624 columns, 1782 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.104e+03 Factor NZ : 2.287e+03 Factor Ops : 8.421e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 6.65714298e+02 -1.47264920e+03 9.49e+02 1.26e-01 8.54e+00 0s 1 1.86750686e+02 -6.16789499e+02 1.52e+02 4.44e-16 1.65e+00 0s 2 6.43619521e+01 -1.82224545e+02 1.84e+01 2.44e-15 2.99e-01 0s 3 3.61562497e+01 -9.09434808e+00 1.66e+00 3.89e-16 4.23e-02 0s 4 2.88530941e+01 1.00519625e+01 3.33e-01 4.44e-16 1.58e-02 0s 5 2.58071169e+01 1.68074119e+01 1.04e-01 2.22e-16 7.34e-03 0s 6 2.52854551e+01 2.00507590e+01 8.12e-02 2.22e-16 4.28e-03 0s 7 2.44555964e+01 2.17409201e+01 4.61e-02 2.50e-16 2.22e-03 0s 8 2.35576490e+01 2.30118958e+01 3.02e-03 2.22e-16 4.39e-04 0s 9 2.35028541e+01 2.34956550e+01 4.46e-14 2.22e-16 5.74e-06 0s 10 2.35000029e+01 2.34999957e+01 7.28e-14 2.22e-16 5.74e-09 0s 11 2.35000000e+01 2.35000000e+01 7.73e-14 4.44e-16 5.74e-12 0s Barrier solved model in 11 iterations and 0.01 seconds Optimal objective 2.35000000e+01 Root relaxation: objective 2.350000e+01, 307 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 23.50000 0 3 32.00000 23.50000 26.6% - 0s H 0 0 24.0000000 23.50000 2.08% - 0s Explored 0 nodes (475 simplex iterations) in 0.04 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.04 seconds Total run time: 0.05 seconds Objective: 24 Solution: 1 x [7, 38] 2 x [3, 37] 1 x [8, 36] 1 x [6, 36] 1 x [10, 35] 1 x [12, 34] 1 x [11, 33] 1 x [13, 32] 1 x [14, 31] 1 x [2, 7, 31] 1 x [1, 13, 30] 2 x [19, 29] 1 x [18, 29] 1 x [16, 28] 1 x [17, 27] 1 x [5, 9, 26] 1 x [4, 26] 1 x [18, 25] 1 x [15, 24] 1 x [23] 1 x [20, 22] 1 x [20, 21]