Build (method = -2) #dp: 11254 Step-3' Graph: 157 vertices and 1811 arcs (0.06s) Step-4' Graph: 131 vertices and 1759 arcs (0.06s) #V4/#V3 = 0.83 #A4/#A3 = 0.97 Ready! (0.06s) Optimize a model with 171 rows, 1760 columns and 5027 nonzeros Presolve removed 5 rows and 10 columns Presolve time: 0.02s Presolved: 166 rows, 1750 columns, 5007 nonzeros Variable types: 0 continuous, 1750 integer (41 binary) Found heuristic solution: objective 794.0000000 Found heuristic solution: objective 784.0000000 Optimize a model with 166 rows, 1750 columns and 5007 nonzeros Presolved: 166 rows, 1750 columns, 5007 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 3.094e+03 Factor NZ : 6.890e+03 Factor Ops : 3.513e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 2.20303823e+04 -8.76688396e+04 9.53e+04 1.01e-01 3.10e+02 0s 1 5.97395417e+03 -3.62297948e+04 1.60e+04 1.11e-15 5.52e+01 0s 2 1.56847559e+03 -1.62022427e+04 2.21e+03 1.64e-14 1.02e+01 0s 3 8.28492478e+02 -3.53637061e+03 1.31e+02 3.77e-15 1.42e+00 0s 4 5.60875105e+02 -1.33290213e+03 3.30e+01 1.33e-15 5.64e-01 0s 5 3.93359363e+02 -5.02918453e+02 1.86e+01 7.04e-16 2.66e-01 0s 6 2.95078226e+02 -2.37666814e+02 1.21e+01 8.36e-16 1.58e-01 0s 7 1.98332996e+02 -6.54748488e+01 6.14e+00 6.79e-16 7.74e-02 0s 8 1.71228482e+02 9.05683527e+01 3.02e+00 6.81e-16 2.35e-02 0s 9 1.60149126e+02 1.08366219e+02 1.76e+00 5.58e-16 1.49e-02 0s 10 1.56251614e+02 1.31724700e+02 1.22e+00 4.44e-16 7.03e-03 0s 11 1.46468903e+02 1.40700550e+02 5.96e-02 5.19e-16 1.63e-03 0s 12 1.45404918e+02 1.44277818e+02 2.63e-03 4.68e-16 3.19e-04 0s 13 1.45307852e+02 1.45155941e+02 4.75e-04 5.60e-16 4.30e-05 0s 14 1.45280024e+02 1.45279861e+02 3.05e-07 4.09e-16 4.60e-08 0s 15 1.45280000e+02 1.45280000e+02 5.28e-13 6.34e-16 4.66e-14 0s Barrier solved model in 15 iterations and 0.02 seconds Optimal objective 1.45280000e+02 Root relaxation: objective 1.452800e+02, 1254 iterations, 0.04 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 145.28000 0 55 784.00000 145.28000 81.5% - 0s H 0 0 147.0000000 145.28000 1.17% - 0s H 0 0 146.0000000 145.28000 0.49% - 0s Explored 0 nodes (1906 simplex iterations) in 0.20 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.460000000000e+02, best bound 1.460000000000e+02, gap 0.0% Preprocessing time: 0.08 seconds Gurobi run time: 0.20 seconds Total run time: 0.27 seconds Objective: 146 Solution: 4 x [6, 10, 16, 17, 30] 9 x [6, 11, 17, 22, 29, 30] 12 x [3, 6, 16, 16, 30, 38] 4 x [4, 30, 32, 40] 1 x [3, 11, 30, 30] 1 x [2, 3, 6, 19, 28] 1 x [2, 3, 5, 6, 19, 28] 2 x [2, 6, 11, 17, 21, 22] 5 x [1, 6, 21, 21, 23] 1 x [1, 20, 25, 26, 39] 6 x [4, 28, 34, 34, 37, 39] 3 x [5, 23, 29, 39, 40] 1 x [16, 17, 24, 39, 40] 10 x [1, 5, 24, 35, 39, 40] 3 x [12, 16, 22, 39, 40] 5 x [1, 25, 26, 39, 39] 4 x [1, 4, 27, 34, 38, 40] 1 x [2, 3, 4, 19, 23] 1 x [11, 27, 33, 40] 5 x [9, 19, 27, 29, 31] 1 x [9, 10, 22, 27, 37, 38] 8 x [7, 9, 13, 13, 13, 14] 4 x [3, 9, 9, 10, 22, 37] 7 x [14, 15, 23, 36, 38, 38] 1 x [12, 15, 19, 23, 36] 4 x [3, 7, 7, 23, 28, 38] 1 x [7, 7, 16, 19, 23, 28] 11 x [5, 8, 10, 18, 21, 23] 7 x [11, 12, 12, 14, 14, 17] 6 x [3, 8, 8, 12, 12, 19] 7 x [7, 8, 15, 36, 36] 3 x [13, 18, 18, 18, 26, 36] 7 x [13, 15, 18, 18, 21, 26]