Build (method = -2) #dp: 2717 Step-3' Graph: 176 vertices and 1089 arcs (0.01s) Step-4' Graph: 106 vertices and 949 arcs (0.01s) #V4/#V3 = 0.60 #A4/#A3 = 0.87 Ready! (0.01s) Optimize a model with 156 rows, 950 columns and 2642 nonzeros Presolve removed 50 rows and 52 columns Presolve time: 0.02s Presolved: 106 rows, 898 columns, 2548 nonzeros Variable types: 0 continuous, 898 integer (793 binary) Found heuristic solution: objective 27.0000000 Optimize a model with 106 rows, 898 columns and 2548 nonzeros Presolved: 106 rows, 898 columns, 2548 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.240e+03 Factor NZ : 2.963e+03 Factor Ops : 1.034e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 2.02692171e+02 -1.38203465e+03 5.52e+03 2.36e-01 8.49e+00 0s 1 1.06537879e+02 -4.99868545e+02 9.50e+02 4.44e-16 1.59e+00 0s 2 4.71069031e+01 -1.08569686e+02 8.02e+01 5.00e-16 1.80e-01 0s 3 2.83047521e+01 -5.58690380e-01 5.04e+00 4.44e-16 2.07e-02 0s 4 2.36853138e+01 1.64350929e+01 1.52e-01 2.22e-16 4.10e-03 0s 5 2.23282446e+01 1.93003295e+01 5.08e-02 2.74e-16 1.70e-03 0s 6 2.18680193e+01 2.01298738e+01 2.52e-02 4.44e-16 9.74e-04 0s 7 2.14491103e+01 2.05560636e+01 8.12e-03 2.70e-16 4.99e-04 0s 8 2.11726798e+01 2.07862423e+01 4.63e-04 2.22e-16 2.15e-04 0s 9 2.11098338e+01 2.09396731e+01 1.47e-04 2.22e-16 9.48e-05 0s 10 2.10830060e+01 2.10132007e+01 2.78e-05 2.22e-16 3.89e-05 0s 11 2.10692439e+01 2.10607275e+01 1.14e-06 2.22e-16 4.74e-06 0s 12 2.10666903e+01 2.10666450e+01 2.94e-09 2.22e-16 2.52e-08 0s 13 2.10666667e+01 2.10666667e+01 1.05e-14 2.22e-16 6.29e-14 0s Barrier solved model in 13 iterations and 0.01 seconds Optimal objective 2.10666667e+01 Root relaxation: objective 2.106667e+01, 96 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 21.06667 0 32 27.00000 21.06667 22.0% - 0s H 0 0 24.0000000 21.06667 12.2% - 0s H 0 0 22.0000000 21.06667 4.24% - 0s Explored 0 nodes (148 simplex iterations) in 0.04 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.02 seconds Gurobi run time: 0.04 seconds Total run time: 0.06 seconds Objective: 22 Solution: 1 x [2, 44] 1 x [28, 42] 1 x [5, 43] 1 x [4, 49] 1 x [30, 39] 1 x [18, 47] 1 x [27, 41] 1 x [14, 50] 1 x [25, 38] 1 x [34, 36] 1 x [15, 48] 1 x [6, 7, 45] 1 x [1, 20, 24] 1 x [29, 40] 1 x [10, 13, 26] 1 x [12, 32] 1 x [33, 35] 1 x [19, 46] 1 x [3, 16, 23] 1 x [31, 37] 1 x [9, 17, 22] 1 x [8, 11, 21]