Build (method = -2) #dp: 924 Step-3' Graph: 59 vertices and 438 arcs (0.01s) Step-4' Graph: 39 vertices and 398 arcs (0.01s) #V4/#V3 = 0.66 #A4/#A3 = 0.91 Ready! (0.01s) Optimize a model with 77 rows, 399 columns and 1123 nonzeros Presolve removed 20 rows and 25 columns Presolve time: 0.01s Presolved: 57 rows, 374 columns, 1036 nonzeros Variable types: 0 continuous, 374 integer (237 binary) Found heuristic solution: objective 34.0000000 Found heuristic solution: objective 33.0000000 Found heuristic solution: objective 30.0000000 Optimize a model with 57 rows, 374 columns and 1036 nonzeros Presolved: 57 rows, 374 columns, 1036 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 5.160e+02 Factor NZ : 1.194e+03 Factor Ops : 3.135e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 8.29934627e+02 -9.04975397e+02 1.42e+03 2.24e-01 9.66e+00 0s 1 2.04857339e+02 -3.04374320e+02 2.32e+02 4.44e-16 1.75e+00 0s 2 5.11619122e+01 -6.91840107e+01 2.00e+01 4.44e-16 2.31e-01 0s 3 2.91500023e+01 4.77845174e+00 1.70e+00 2.22e-16 3.59e-02 0s 4 2.46392914e+01 1.58006422e+01 1.98e-01 2.22e-16 1.19e-02 0s 5 2.25143799e+01 1.95882021e+01 6.36e-02 2.22e-16 3.89e-03 0s 6 2.19670812e+01 2.08056768e+01 2.52e-02 2.22e-16 1.54e-03 0s 7 2.16327537e+01 2.10687692e+01 7.42e-03 2.63e-16 7.47e-04 0s 8 2.15133009e+01 2.14643680e+01 6.84e-04 2.22e-16 6.48e-05 0s 9 2.15000714e+01 2.14995464e+01 1.30e-07 2.22e-16 6.95e-07 0s 10 2.15000001e+01 2.14999995e+01 1.85e-13 3.54e-16 6.95e-10 0s 11 2.15000000e+01 2.15000000e+01 8.89e-14 2.22e-16 7.07e-16 0s Barrier solved model in 11 iterations and 0.00 seconds Optimal objective 2.15000000e+01 Root relaxation: objective 2.150000e+01, 180 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 21.50000 0 4 30.00000 21.50000 28.3% - 0s H 0 0 24.0000000 21.50000 10.4% - 0s H 0 0 22.0000000 21.50000 2.27% - 0s Explored 0 nodes (274 simplex iterations) in 0.02 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 2.200000000000e+01, best bound 2.200000000000e+01, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.02 seconds Total run time: 0.03 seconds Objective: 22 Solution: 1 x [12, 38] 1 x [12, 37] 1 x [13, 36] 1 x [15, 35] 1 x [14, 35] 2 x [16, 34] 1 x [9, 33] 1 x [18, 32] 1 x [23, 31] 1 x [1, 5, 31] 2 x [24, 30] 1 x [2, 6, 29] 1 x [26, 28] 1 x [26, 27] 1 x [22, 25] 1 x [4, 8, 21] 1 x [4, 10, 20] 1 x [5, 11, 19] 1 x [7, 8, 17] 1 x [3, 7]