Build (method = -2) #dp: 9820 Step-3' Graph: 1662 vertices and 4979 arcs (0.08s) Step-4' Graph: 791 vertices and 3237 arcs (0.08s) #V4/#V3 = 0.48 #A4/#A3 = 0.65 Ready! (0.08s) Optimize a model with 831 rows, 3238 columns and 8136 nonzeros Presolve removed 160 rows and 273 columns Presolve time: 0.06s Presolved: 671 rows, 2965 columns, 8091 nonzeros Variable types: 0 continuous, 2965 integer (178 binary) Found heuristic solution: objective 264.0000000 Found heuristic solution: objective 250.0000000 Optimize a model with 671 rows, 2965 columns and 8091 nonzeros Presolved: 671 rows, 2965 columns, 8091 nonzeros Root barrier log... Ordering time: 0.01s Barrier statistics: AA' NZ : 5.550e+03 Factor NZ : 2.786e+04 (roughly 2 MBytes of memory) Factor Ops : 2.055e+06 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 5.16603287e+03 -5.00618622e+04 2.14e+05 9.46e-02 1.99e+02 0s 1 1.04261101e+03 -3.25196589e+04 2.03e+04 6.66e-16 2.28e+01 0s 2 5.19107682e+02 -1.36181212e+04 4.04e+03 8.88e-16 5.36e+00 0s 3 3.37683763e+02 -2.84697697e+03 5.63e+02 2.22e-15 8.62e-01 0s 4 2.84057047e+02 -7.10220241e+02 1.23e+02 8.60e-16 2.20e-01 0s 5 2.67716321e+02 -4.68196663e+02 4.61e+01 9.99e-16 1.40e-01 0s 6 2.51364402e+02 -3.31441628e+02 1.95e+01 9.99e-16 1.04e-01 0s 7 2.26817724e+02 -1.84406165e+02 5.98e+00 5.00e-16 7.07e-02 0s 8 1.96481078e+02 -6.35650698e+01 2.19e+00 4.04e-16 4.42e-02 0s 9 1.73999372e+02 3.04207688e+01 8.82e-01 3.76e-16 2.43e-02 0s 10 1.66885986e+02 8.40414539e+01 5.79e-01 4.09e-16 1.40e-02 0s 11 1.62175567e+02 1.07469182e+02 3.88e-01 3.40e-16 9.26e-03 0s 12 1.58285319e+02 1.26331611e+02 1.90e-01 2.97e-16 5.40e-03 0s 13 1.53875139e+02 1.46227946e+02 2.60e-02 3.63e-16 1.29e-03 0s 14 1.53041339e+02 1.52662220e+02 9.69e-05 4.40e-16 6.37e-05 0s 15 1.53000155e+02 1.52999661e+02 2.58e-07 5.28e-16 8.31e-08 0s 16 1.53000000e+02 1.53000000e+02 1.85e-12 4.44e-16 8.32e-14 0s Barrier solved model in 16 iterations and 0.08 seconds Optimal objective 1.53000000e+02 Root relaxation: objective 1.530000e+02, 1243 iterations, 0.09 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 153.0000000 153.00000 0.0% - 0s Explored 0 nodes (1623 simplex iterations) in 0.23 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.530000000000e+02, best bound 1.530000000000e+02, gap 0.0% Preprocessing time: 0.10 seconds Gurobi run time: 0.23 seconds Total run time: 0.33 seconds Objective: 153 Solution: 4 x [1, 27, 40] 8 x [1, 28] 6 x [1, 30] 3 x [2, 25] 4 x [2, 26] 2 x [3, 29] 1 x [4, 33, 34] 5 x [5, 21] 16 x [5, 22] 1 x [6, 32, 37] 1 x [7, 30, 33, 39] 9 x [8, 19] 3 x [8, 28, 31] 5 x [8, 32, 33, 35] 1 x [9] 3 x [9, 23, 35] 6 x [9, 30, 35, 36, 37] 3 x [10, 18] 12 x [10, 18, 38] 1 x [10, 31, 34, 36] 3 x [10, 34] 1 x [11, 20, 35] 3 x [11, 24, 35, 36, 40] 3 x [11, 25, 32] 8 x [11, 25, 33, 36] 2 x [11, 29, 32] 3 x [11, 40] 6 x [12, 17] 4 x [12, 26, 27] 2 x [12, 31, 32, 33, 40] 11 x [13, 16] 2 x [14] 5 x [14, 15] 6 x [14, 16]