Build (method = -2) #dp: 2356 Step-3' Graph: 469 vertices and 1400 arcs (0.01s) Step-4' Graph: 199 vertices and 860 arcs (0.02s) #V4/#V3 = 0.42 #A4/#A3 = 0.61 Ready! (0.02s) Optimize a model with 236 rows, 861 columns and 2189 nonzeros Presolve removed 45 rows and 68 columns Presolve time: 0.01s Presolved: 191 rows, 793 columns, 2111 nonzeros Variable types: 0 continuous, 793 integer (55 binary) Found heuristic solution: objective 293.0000000 Found heuristic solution: objective 286.0000000 Optimize a model with 191 rows, 793 columns and 2111 nonzeros Presolved: 191 rows, 793 columns, 2111 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.494e+03 Factor NZ : 5.134e+03 Factor Ops : 1.792e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 3.11753651e+03 -1.39596814e+04 2.57e+04 8.34e-02 9.95e+01 0s 1 1.00405660e+03 -7.22077354e+03 3.69e+03 4.44e-16 1.67e+01 0s 2 4.39966080e+02 -2.27248612e+03 3.95e+02 1.33e-15 2.68e+00 0s 3 3.31501765e+02 -5.15208663e+02 3.87e+01 9.99e-16 5.88e-01 0s 4 2.81220807e+02 -1.05588317e+02 3.00e+00 3.33e-16 2.44e-01 0s 5 2.55439133e+02 5.72169875e+01 1.46e+00 3.05e-16 1.25e-01 0s 6 2.40344976e+02 1.45467544e+02 7.76e-01 2.15e-16 5.95e-02 0s 7 2.27750168e+02 1.91778476e+02 3.24e-01 1.50e-16 2.25e-02 0s 8 2.22943145e+02 1.98124763e+02 1.03e-01 1.68e-16 1.55e-02 0s 9 2.19833642e+02 2.08285533e+02 3.26e-02 1.39e-16 7.20e-03 0s 10 2.18749233e+02 2.14719146e+02 1.36e-02 2.55e-16 2.51e-03 0s 11 2.18156358e+02 2.17783671e+02 3.49e-03 2.22e-16 2.33e-04 0s 12 2.18017333e+02 2.17979539e+02 3.29e-04 2.22e-16 2.37e-05 0s 13 2.18000063e+02 2.17999980e+02 9.22e-07 3.29e-16 5.20e-08 0s 14 2.18000000e+02 2.18000000e+02 1.49e-11 2.51e-16 5.20e-11 0s Barrier solved model in 14 iterations and 0.01 seconds Optimal objective 2.18000000e+02 Root relaxation: objective 2.180000e+02, 383 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 218.0000000 218.00000 0.0% - 0s Explored 0 nodes (446 simplex iterations) in 0.04 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 2.180000000000e+02, best bound 2.180000000000e+02, gap 0.0% Preprocessing time: 0.03 seconds Gurobi run time: 0.04 seconds Total run time: 0.06 seconds Objective: 218 Solution: 17 x [1] 2 x [2] 14 x [2, 30] 6 x [2, 33] 3 x [2, 33, 35] 2 x [2, 35] 10 x [3] 5 x [3, 31] 14 x [4] 1 x [4, 32, 34, 37] 7 x [5] 6 x [5, 29] 8 x [6] 3 x [6, 28] 3 x [7] 11 x [7, 29] 11 x [8, 26] 1 x [8, 27, 37] 9 x [9, 25] 9 x [10, 20] 2 x [10, 22] 8 x [11, 17] 4 x [11, 19] 3 x [12, 14] 2 x [13, 14] 9 x [13, 18] 5 x [13, 23] 12 x [14, 19] 3 x [15, 16] 2 x [15, 17] 7 x [15, 23] 4 x [18, 20, 36] 1 x [19, 20] 7 x [21, 22, 33] 1 x [23, 25, 27, 37] 6 x [24, 25, 26]