Build (method = -2) #dp: 305 Step-3' Graph: 32 vertices and 153 arcs (0.00s) Step-4' Graph: 23 vertices and 135 arcs (0.00s) #V4/#V3 = 0.72 #A4/#A3 = 0.88 Ready! (0.00s) Optimize a model with 42 rows, 136 columns and 369 nonzeros Presolve removed 11 rows and 15 columns Presolve time: 0.00s Presolved: 31 rows, 121 columns, 331 nonzeros Variable types: 0 continuous, 121 integer (0 binary) Found heuristic solution: objective 183.0000000 Found heuristic solution: objective 167.0000000 Optimize a model with 31 rows, 121 columns and 331 nonzeros Presolved: 31 rows, 121 columns, 331 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.670e+02 Factor NZ : 4.280e+02 Factor Ops : 7.560e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 7.79919529e+02 -1.16620264e+03 2.24e+03 1.11e-16 3.19e+01 0s 1 2.52559981e+02 -4.51884165e+02 2.07e+02 3.33e-16 4.56e+00 0s 2 1.39684881e+02 -2.38524100e+01 3.78e-01 6.66e-16 6.48e-01 0s 3 1.05383809e+02 4.75754539e+01 4.79e-02 4.44e-16 2.29e-01 0s 4 9.40978513e+01 8.37279448e+01 3.06e-03 3.82e-16 4.10e-02 0s 5 9.23771368e+01 8.86051450e+01 8.14e-04 2.89e-16 1.49e-02 0s 6 9.15201681e+01 9.06069962e+01 1.35e-04 2.98e-16 3.61e-03 0s 7 9.13051385e+01 9.11558756e+01 4.35e-05 2.71e-16 5.90e-04 0s 8 9.12574290e+01 9.12392798e+01 1.21e-06 3.18e-16 7.17e-05 0s 9 9.12501278e+01 9.12497341e+01 2.57e-09 5.27e-16 1.56e-06 0s 10 9.12500001e+01 9.12499997e+01 5.96e-12 3.05e-16 1.56e-09 0s 11 9.12500000e+01 9.12500000e+01 4.92e-12 3.33e-16 1.71e-15 0s Barrier solved model in 11 iterations and 0.00 seconds Optimal objective 9.12500000e+01 Root relaxation: objective 9.125000e+01, 34 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 91.25000 0 5 167.00000 91.25000 45.4% - 0s H 0 0 92.0000000 91.25000 0.82% - 0s Explored 0 nodes (51 simplex iterations) in 0.01 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 9.200000000000e+01, best bound 9.200000000000e+01, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.01 seconds Total run time: 0.01 seconds Objective: 92 Solution: 17 x [7, 10] 5 x [9, 12] 4 x [12, 17] 1 x [12, 16] 5 x [8, 13] 9 x [6, 15] 5 x [2, 15] 2 x [13, 15] 3 x [4, 6] 2 x [5, 19] 8 x [3, 5] 12 x [1, 11] 1 x [1, 1] 1 x [5, 6, 7] 4 x [5, 16, 18] 8 x [5, 14, 16] 4 x [13, 13, 14] 1 x [16]