Build (method = -2) #dp: 895 Step-3' Graph: 72 vertices and 364 arcs (0.00s) Step-4' Graph: 44 vertices and 308 arcs (0.00s) #V4/#V3 = 0.61 #A4/#A3 = 0.85 Ready! (0.00s) Optimize a model with 83 rows, 309 columns and 846 nonzeros Presolve removed 22 rows and 29 columns Presolve time: 0.00s Presolved: 61 rows, 280 columns, 773 nonzeros Variable types: 0 continuous, 280 integer (27 binary) Found heuristic solution: objective 358.0000000 Found heuristic solution: objective 317.0000000 Optimize a model with 61 rows, 280 columns and 773 nonzeros Presolved: 61 rows, 280 columns, 773 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 4.010e+02 Factor NZ : 1.092e+03 Factor Ops : 2.231e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 5.60342135e+03 -7.03070797e+03 1.76e+04 2.04e-01 1.18e+02 0s 1 1.81901867e+03 -2.37351436e+03 3.71e+03 8.33e-16 2.49e+01 0s 2 4.39387532e+02 -8.76054764e+02 2.43e+02 6.66e-16 3.19e+00 0s 3 2.68764354e+02 -1.99134707e+01 1.51e+01 2.00e-15 5.27e-01 0s 4 2.03028143e+02 1.03646589e+02 3.06e+00 5.00e-16 1.75e-01 0s 5 1.90176576e+02 1.60994962e+02 9.66e-01 4.65e-16 5.09e-02 0s 6 1.85045704e+02 1.70332206e+02 1.87e-01 5.04e-16 2.55e-02 0s 7 1.83784446e+02 1.77443240e+02 1.04e-01 4.15e-16 1.10e-02 0s 8 1.82610486e+02 1.81204744e+02 1.30e-02 3.12e-16 2.43e-03 0s 9 1.82231660e+02 1.81935651e+02 2.06e-03 2.91e-16 5.12e-04 0s 10 1.82148425e+02 1.82147497e+02 2.49e-13 3.75e-16 1.60e-06 0s 11 1.82148148e+02 1.82148147e+02 4.92e-14 2.54e-16 1.60e-09 0s 12 1.82148148e+02 1.82148148e+02 1.07e-13 4.44e-16 1.60e-12 0s Barrier solved model in 12 iterations and 0.00 seconds Optimal objective 1.82148148e+02 Root relaxation: objective 1.821481e+02, 47 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 182.14815 0 13 317.00000 182.14815 42.5% - 0s H 0 0 183.0000000 182.14815 0.47% - 0s Explored 0 nodes (79 simplex iterations) in 0.01 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.830000000000e+02, best bound 1.830000000000e+02, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.01 seconds Total run time: 0.02 seconds Objective: 183 Solution: 1 x [6] 10 x [14, 28] 9 x [11, 14] 11 x [34, 37] 9 x [1, 31] 10 x [3, 5] 1 x [10, 15] 9 x [8, 15] 8 x [12, 19] 2 x [2, 26] 8 x [32, 38] 3 x [32, 36] 4 x [19, 35] 10 x [27, 32] 12 x [4, 24] 3 x [23, 39] 6 x [23, 26] 11 x [21, 39] 14 x [9, 20] 2 x [7, 20] 8 x [17, 22, 22] 5 x [9, 16] 2 x [33, 33] 8 x [3, 3, 25] 4 x [1, 1, 25] 4 x [3, 8, 13] 2 x [18, 19, 30] 1 x [18, 19, 26] 1 x [18, 26] 1 x [11, 11, 18, 29] 2 x [11, 11, 11, 18] 1 x [1, 11] 1 x [1, 1, 1, 11]