Build (method = -2) #dp: 1899 Step-3' Graph: 74 vertices and 386 arcs (0.01s) Step-4' Graph: 41 vertices and 320 arcs (0.01s) #V4/#V3 = 0.55 #A4/#A3 = 0.83 Ready! (0.01s) Optimize a model with 80 rows, 321 columns and 885 nonzeros Presolve removed 19 rows and 20 columns Presolve time: 0.00s Presolved: 61 rows, 301 columns, 836 nonzeros Variable types: 0 continuous, 301 integer (168 binary) Found heuristic solution: objective 28.0000000 Optimize a model with 61 rows, 301 columns and 836 nonzeros Presolved: 61 rows, 301 columns, 836 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 5.100e+02 Factor NZ : 1.186e+03 Factor Ops : 2.917e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 5.89356668e+02 -1.07276474e+03 1.25e+03 2.31e-01 1.50e+01 0s 1 1.70289428e+02 -3.03037120e+02 2.38e+02 5.55e-16 2.87e+00 0s 2 4.65300020e+01 -8.38897680e+01 1.71e+01 3.89e-16 3.40e-01 0s 3 2.66705698e+01 1.81635727e+00 8.79e-01 3.33e-16 4.44e-02 0s 4 2.26195200e+01 1.52204098e+01 1.92e-01 1.11e-16 1.25e-02 0s 5 2.11677161e+01 1.87420758e+01 6.42e-02 1.11e-16 4.06e-03 0s 6 2.04391329e+01 1.95050113e+01 1.81e-02 2.22e-16 1.55e-03 0s 7 2.02504640e+01 1.98034203e+01 5.36e-03 2.22e-16 7.40e-04 0s 8 2.01570298e+01 1.99989059e+01 1.57e-03 1.26e-16 2.61e-04 0s 9 2.01077935e+01 2.00566685e+01 2.77e-04 2.22e-16 8.44e-05 0s 10 2.00930199e+01 2.00897710e+01 3.23e-06 2.22e-16 5.35e-06 0s 11 2.00925930e+01 2.00925898e+01 5.47e-14 2.22e-16 5.40e-09 0s 12 2.00925926e+01 2.00925926e+01 1.95e-14 2.22e-16 5.40e-12 0s Barrier solved model in 12 iterations and 0.00 seconds Optimal objective 2.00925926e+01 Root relaxation: objective 2.009259e+01, 75 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 20.09259 0 24 28.00000 20.09259 28.2% - 0s H 0 0 22.0000000 20.09259 8.67% - 0s * 0 0 0 21.0000000 21.00000 0.0% - 0s Cutting planes: Gomory: 2 MIR: 6 Zero half: 4 Explored 0 nodes (136 simplex iterations) in 0.02 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 2.100000000000e+01, best bound 2.100000000000e+01, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.02 seconds Total run time: 0.04 seconds Objective: 21 Solution: 1 x [14, 39] 1 x [16, 38] 2 x [15, 37] 1 x [14, 37] 1 x [6, 11, 36] 1 x [17, 35] 1 x [18, 34] 1 x [4, 33] 1 x [21, 32] 1 x [5, 13, 32] 1 x [20, 31] 1 x [1, 19, 31] 1 x [3, 12, 31] 1 x [9, 10, 30] 1 x [25, 29] 1 x [8, 13, 29] 1 x [2, 22, 28] 1 x [7, 27] 1 x [23, 26] 1 x [9, 17, 24]