Build (method = -2) #dp: 6091 Step-3' Graph: 597 vertices and 2438 arcs (0.03s) Step-4' Graph: 594 vertices and 2432 arcs (0.03s) #V4/#V3 = 0.99 #A4/#A3 = 1.00 Ready! (0.03s) Optimize a model with 602 rows, 2433 columns and 6151 nonzeros Presolve removed 127 rows and 249 columns Presolve time: 0.03s Presolved: 475 rows, 2184 columns, 5725 nonzeros Variable types: 0 continuous, 2184 integer (0 binary) Found heuristic solution: objective 1000.0000000 Optimize a model with 475 rows, 2184 columns and 5725 nonzeros Presolved: 475 rows, 2184 columns, 5725 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 3.358e+03 Factor NZ : 2.002e+04 (roughly 1 MByte of memory) Factor Ops : 1.368e+06 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 4.62974041e+03 -3.63626510e+05 2.26e+05 2.22e-16 5.19e+02 0s 1 1.88224664e+03 -2.43143404e+05 5.23e+04 5.55e-16 1.47e+02 0s 2 1.19738135e+03 -7.73511235e+04 1.32e+04 3.44e-15 3.61e+01 0s 3 1.03029049e+03 -2.16726533e+04 2.77e+03 7.68e-14 8.37e+00 0s 4 9.76997705e+02 -4.69728346e+03 2.31e+02 2.00e-14 1.47e+00 0s 5 9.02540364e+02 -2.12077726e+03 9.61e-11 1.05e-14 6.91e-01 0s 6 8.22532018e+02 -1.54244667e+03 7.08e-11 8.33e-15 5.41e-01 0s 7 7.33418219e+02 -9.06122439e+02 4.96e-11 6.11e-15 3.75e-01 0s 8 6.00775961e+02 -6.86058899e+02 3.94e-11 3.77e-15 2.94e-01 0s 9 4.72415256e+02 -4.62696445e+02 2.86e-11 3.10e-15 2.14e-01 0s 10 3.32802804e+02 -2.08602113e+02 1.86e-11 2.40e-15 1.24e-01 0s 11 1.83665355e+02 -1.17754148e+02 7.40e-12 2.53e-15 6.89e-02 0s 12 1.50805348e+02 -5.67510958e+01 5.03e-12 2.84e-15 4.74e-02 0s 13 1.08569310e+02 -3.45680208e+00 2.19e-12 2.67e-15 2.56e-02 0s 14 1.03118290e+02 3.57761640e+01 1.89e-12 2.52e-15 1.54e-02 0s 15 9.49520320e+01 5.27651530e+01 1.02e-12 2.57e-15 9.64e-03 0s 16 9.16944001e+01 6.75593772e+01 7.49e-13 2.76e-15 5.52e-03 0s 17 8.70622211e+01 7.50312004e+01 4.64e-13 2.47e-15 2.75e-03 0s 18 8.41754939e+01 7.91357289e+01 5.08e-13 2.41e-15 1.15e-03 0s 19 8.35658176e+01 8.04759076e+01 8.48e-13 2.36e-15 7.06e-04 0s 20 8.31657596e+01 8.12883681e+01 3.94e-13 2.55e-15 4.29e-04 0s 21 8.29318503e+01 8.20385139e+01 5.84e-13 2.15e-15 2.04e-04 0s 22 8.27379190e+01 8.24361858e+01 2.97e-12 2.18e-15 6.90e-05 0s 23 8.26950770e+01 8.25590072e+01 1.26e-12 1.96e-15 3.11e-05 0s 24 8.26756547e+01 8.25876180e+01 1.79e-12 2.60e-15 2.01e-05 0s 25 8.26519624e+01 8.26179692e+01 3.60e-12 2.16e-15 7.77e-06 0s 26 8.26471319e+01 8.26308701e+01 3.06e-12 2.52e-15 3.72e-06 0s 27 8.26450362e+01 8.26448165e+01 1.87e-12 1.70e-15 5.02e-08 0s 28 8.26450000e+01 8.26449998e+01 7.26e-12 2.03e-15 5.02e-11 0s Barrier solved model in 28 iterations and 0.07 seconds Optimal objective 8.26450000e+01 Root relaxation: objective 8.264500e+01, 637 iterations, 0.08 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 82.64500 0 41 1000.00000 82.64500 91.7% - 0s H 0 0 84.0000000 82.64500 1.61% - 0s H 0 0 83.0000000 82.64500 0.43% - 0s Explored 0 nodes (1793 simplex iterations) in 0.25 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 8.300000000000e+01, best bound 8.300000000000e+01, gap 0.0% Preprocessing time: 0.05 seconds Gurobi run time: 0.25 seconds Total run time: 0.30 seconds Objective: 83 Solution: 1 x [1, 2, 4, 7, 7, 8] 1 x [1, 2, 2, 2, 4, 7, 7, 7, 8] 25 x [1, 2, 4, 4, 4, 4, 6, 6, 6] 22 x [2, 2, 2, 2, 2, 4, 4, 4, 5, 5, 5, 5, 5, 6] 8 x [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 6, 6, 6, 6, 6, 7] 19 x [2, 3, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7] 4 x [7, 7, 7, 7, 7, 7, 7, 7] 3 x [2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 8]