Build (method = -2) #dp: 10883 Step-3' Graph: 125 vertices and 1932 arcs (0.05s) Step-4' Graph: 97 vertices and 1876 arcs (0.05s) #V4/#V3 = 0.78 #A4/#A3 = 0.97 Ready! (0.05s) Optimize a model with 157 rows, 1877 columns and 5445 nonzeros Presolve removed 2 rows and 2 columns Presolve time: 0.01s Presolved: 155 rows, 1875 columns, 5441 nonzeros Variable types: 0 continuous, 1875 integer (33 binary) Found heuristic solution: objective 1152.0000000 Found heuristic solution: objective 1110.0000000 Optimize a model with 155 rows, 1875 columns and 5441 nonzeros Presolved: 155 rows, 1875 columns, 5441 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 3.086e+03 Factor NZ : 5.806e+03 Factor Ops : 2.825e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 3.48277872e+04 -1.25802240e+05 9.54e+04 3.32e-02 3.81e+02 0s 1 9.63910619e+03 -4.24976776e+04 1.61e+04 6.66e-16 6.71e+01 0s 2 2.87715721e+03 -2.03932890e+04 3.05e+03 1.15e-14 1.51e+01 0s 3 1.24762012e+03 -5.10234226e+03 2.45e+02 9.77e-15 2.12e+00 0s 4 9.43113216e+02 -1.68925927e+03 6.13e+01 4.11e-15 7.56e-01 0s 5 7.67699525e+02 -9.42655769e+02 4.26e+01 2.11e-15 4.86e-01 0s 6 5.37018000e+02 -5.45952534e+02 2.12e+01 1.33e-15 3.00e-01 0s 7 3.55450434e+02 -2.15597352e+02 1.13e+01 7.77e-16 1.57e-01 0s 8 2.76642455e+02 7.16338639e+01 5.26e+00 3.33e-16 5.55e-02 0s 9 2.63848371e+02 1.65249183e+02 2.66e+00 3.33e-16 2.63e-02 0s 10 2.42618175e+02 2.00476363e+02 8.65e-01 3.87e-16 1.11e-02 0s 11 2.34358158e+02 2.25288861e+02 5.30e-02 3.33e-16 2.38e-03 0s 12 2.33477185e+02 2.31534348e+02 8.65e-03 2.95e-16 5.10e-04 0s 13 2.33407548e+02 2.33372598e+02 2.82e-11 3.33e-16 9.18e-06 0s 14 2.33400000e+02 2.33399995e+02 2.24e-11 3.59e-16 1.38e-09 0s 15 2.33400000e+02 2.33400000e+02 1.21e-11 3.48e-16 1.74e-15 0s Barrier solved model in 15 iterations and 0.02 seconds Optimal objective 2.33400000e+02 Root relaxation: objective 2.334000e+02, 1504 iterations, 0.04 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 233.40000 0 48 1110.00000 233.40000 79.0% - 0s H 0 0 236.0000000 233.40000 1.10% - 0s H 0 0 234.0000000 233.40000 0.26% - 0s Explored 0 nodes (3068 simplex iterations) in 0.24 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 2.340000000000e+02, best bound 2.340000000000e+02, gap 0.0% Preprocessing time: 0.06 seconds Gurobi run time: 0.24 seconds Total run time: 0.30 seconds Objective: 234 Solution: 4 x [2, 8, 16, 30, 54] 7 x [21, 46, 46, 46, 54] 2 x [9, 19, 34, 36, 54] 1 x [9, 19, 30, 34, 36] 1 x [2, 8, 30, 43, 53] 3 x [9, 30, 30, 34, 36] 8 x [30, 30, 45, 47, 47] 1 x [10, 21, 31, 38, 52] 1 x [21, 27, 31, 37, 59] 4 x [16, 19, 31, 45, 52] 2 x [9, 15, 21, 45, 59] 9 x [6, 16, 21, 58, 60] 3 x [1, 21, 52, 56, 57] 1 x [19, 46, 47, 55, 56] 4 x [13, 13, 19, 56, 60] 12 x [3, 8, 13, 19, 40] 10 x [9, 14, 14, 45, 59] 14 x [1, 9, 15, 43, 52] 4 x [7, 40, 43, 46, 47] 1 x [1, 7, 9, 15, 52] 8 x [15, 35, 39, 52, 57] 1 x [1, 7, 9, 55] 17 x [2, 22, 28, 38, 49] 4 x [2, 28, 28, 38, 49] 17 x [24, 25, 27, 51, 59] 1 x [13, 25, 32, 36, 59] 2 x [8, 13, 25, 40, 40] 5 x [3, 13, 25, 40, 40] 3 x [10, 10, 23, 25, 27] 12 x [5, 37, 38, 51, 55] 1 x [5, 36, 37, 51, 52] 4 x [6, 17, 51, 53, 58] 10 x [6, 11, 17, 33, 37] 6 x [4, 6, 27, 44, 55] 1 x [1, 6, 46, 55, 59] 2 x [6, 6, 37, 52, 55] 3 x [10, 27, 36, 55, 60] 1 x [46, 50, 55] 4 x [39, 41, 42, 55, 60] 6 x [1, 23, 39, 41, 50] 4 x [12, 45, 48, 60, 60] 1 x [12, 36, 45, 60, 60] 11 x [18, 20, 26, 29, 50] 3 x [18, 20, 23, 29, 50] 15 x [10, 12, 20, 23, 39]