Build (method = -2) #dp: 5709 Step-3' Graph: 1016 vertices and 3041 arcs (0.04s) Step-4' Graph: 496 vertices and 2001 arcs (0.05s) #V4/#V3 = 0.49 #A4/#A3 = 0.66 Ready! (0.05s) Optimize a model with 535 rows, 2002 columns and 5018 nonzeros Presolve removed 121 rows and 220 columns Presolve time: 0.03s Presolved: 414 rows, 1782 columns, 4877 nonzeros Variable types: 0 continuous, 1782 integer (175 binary) Found heuristic solution: objective 238.0000000 Found heuristic solution: objective 233.0000000 Optimize a model with 414 rows, 1782 columns and 4877 nonzeros Presolved: 414 rows, 1782 columns, 4877 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 3.298e+03 Factor NZ : 1.503e+04 (roughly 1 MByte of memory) Factor Ops : 8.976e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.57048710e+03 -2.64824311e+04 4.31e+04 2.22e-16 6.50e+01 0s 1 5.84562289e+02 -1.23818673e+04 6.63e+03 4.44e-16 1.16e+01 0s 2 3.62295026e+02 -4.92407761e+03 1.23e+03 5.55e-16 2.77e+00 0s 3 2.72769403e+02 -1.00662304e+03 1.34e+02 2.44e-15 4.60e-01 0s 4 2.52084412e+02 -3.53320336e+02 3.40e+01 7.77e-16 1.87e-01 0s 5 2.31406962e+02 -1.70985672e+02 1.71e+01 8.88e-16 1.20e-01 0s 6 2.21755151e+02 -5.89615319e+01 1.09e+01 4.72e-16 8.25e-02 0s 7 1.98879075e+02 3.76703559e+01 3.05e+00 3.50e-16 4.60e-02 0s 8 1.89543280e+02 7.06558694e+01 2.20e+00 2.91e-16 3.38e-02 0s 9 1.70835374e+02 9.98438634e+01 5.82e-01 3.33e-16 2.00e-02 0s 10 1.63882154e+02 1.42409698e+02 2.05e-01 4.27e-16 6.04e-03 0s 11 1.60919170e+02 1.54333935e+02 5.31e-02 3.18e-16 1.85e-03 0s 12 1.60147238e+02 1.59422717e+02 5.48e-03 3.71e-16 2.04e-04 0s 13 1.60002794e+02 1.59995182e+02 4.69e-05 4.08e-16 2.14e-06 0s 14 1.60000000e+02 1.60000000e+02 1.19e-09 4.54e-16 2.02e-11 0s Barrier solved model in 14 iterations and 0.03 seconds Optimal objective 1.60000000e+02 Root relaxation: objective 1.600000e+02, 845 iterations, 0.04 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 160.00000 0 15 233.00000 160.00000 31.3% - 0s H 0 0 167.0000000 160.00000 4.19% - 0s H 0 0 161.0000000 160.00000 0.62% - 0s H 0 0 160.0000000 160.00000 0.0% - 0s Explored 0 nodes (1450 simplex iterations) in 0.13 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.600000000000e+02, best bound 1.600000000000e+02, gap 0.0% Preprocessing time: 0.06 seconds Gurobi run time: 0.13 seconds Total run time: 0.20 seconds Objective: 160 Solution: 4 x [1, 28, 39] 1 x [1, 29, 38, 39] 2 x [1, 29, 39] 5 x [1, 31] 3 x [1, 32, 33] 2 x [1, 35] 5 x [2, 29, 36, 38] 2 x [3, 27, 39] 6 x [3, 29, 33] 7 x [3, 30, 32] 2 x [3, 32, 34] 2 x [3, 33, 35] 1 x [4, 26] 2 x [4, 31] 4 x [5] 8 x [5, 25] 3 x [5, 31, 35] 3 x [6, 29, 32] 1 x [6, 29, 39] 1 x [6, 31] 2 x [6, 33] 2 x [6, 33, 36] 1 x [7, 24] 11 x [8, 24] 2 x [8, 39] 4 x [9, 22] 4 x [9, 23] 3 x [9, 24, 39] 3 x [10, 24] 15 x [11, 21] 2 x [11, 23] 1 x [11, 29, 33, 39] 1 x [12, 21] 12 x [13, 20] 1 x [13, 30, 33, 35, 39] 9 x [14, 19, 37] 4 x [14, 20] 5 x [15, 18] 2 x [16, 18] 3 x [17, 18] 2 x [18, 19, 35, 37, 39] 5 x [18, 19, 35, 39] 2 x [18, 19, 39]