Build (method = -2) #dp: 49827 Step-3' Graph: 1168 vertices and 7526 arcs (0.31s) Step-4' Graph: 1077 vertices and 7343 arcs (0.32s) #V4/#V3 = 0.92 #A4/#A3 = 0.98 Ready! (0.32s) Optimize a model with 1097 rows, 7344 columns and 19890 nonzeros Presolve removed 86 rows and 169 columns Presolve time: 0.06s Presolved: 1011 rows, 7175 columns, 19810 nonzeros Variable types: 0 continuous, 7175 integer (0 binary) Found heuristic solution: objective 2000.0000000 Optimize a model with 1011 rows, 7175 columns and 19810 nonzeros Presolved: 1011 rows, 7175 columns, 19810 nonzeros Root barrier log... Ordering time: 0.01s Barrier statistics: AA' NZ : 1.258e+04 Factor NZ : 7.878e+04 (roughly 4 MBytes of memory) Factor Ops : 1.085e+07 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 2.78587428e+04 -1.68053378e+06 1.52e+06 2.22e-16 1.22e+03 0s 1 6.42671973e+03 -1.10042326e+06 2.18e+05 6.66e-16 2.26e+02 0s 2 4.42460691e+03 -5.15856076e+05 8.66e+04 1.78e-15 8.96e+01 0s 3 2.89259289e+03 -2.22791838e+05 2.90e+04 2.66e-15 3.20e+01 0s 4 2.24806115e+03 -9.72052041e+04 8.15e+03 2.71e-14 1.11e+01 0s 5 2.04211170e+03 -4.88940962e+04 1.56e+03 1.24e-14 4.23e+00 0s 6 1.99350335e+03 -2.10211968e+04 7.63e+01 4.66e-15 1.63e+00 0s 7 1.91747577e+03 -8.06817771e+03 1.55e-11 2.66e-15 6.95e-01 0s 8 1.51801930e+03 -6.36521287e+03 9.76e-12 2.22e-15 5.49e-01 0s 9 1.09397327e+03 -3.85456144e+03 5.81e-12 1.44e-15 3.44e-01 0s 10 8.12724742e+02 -2.29797001e+03 4.22e-12 8.54e-16 2.16e-01 0s 11 4.89896087e+02 -9.73753821e+02 2.69e-12 7.20e-16 1.02e-01 0s 12 3.87173904e+02 -3.23976577e+02 1.78e-12 8.01e-16 4.95e-02 0s 13 3.04320922e+02 -1.05734839e+02 3.01e-12 6.66e-16 2.85e-02 0s 14 3.12832103e+02 -2.49063527e+01 2.96e-12 7.93e-16 2.35e-02 0s 15 2.81248794e+02 5.96364468e+01 1.40e-12 8.16e-16 1.54e-02 0s 16 2.52271788e+02 1.38002117e+02 6.14e-12 7.32e-16 7.95e-03 0s 17 2.48049545e+02 1.66973990e+02 2.59e-12 7.26e-16 5.64e-03 0s 18 2.42489644e+02 2.02198388e+02 5.27e-12 6.76e-16 2.80e-03 0s 19 2.32469752e+02 2.20692076e+02 8.07e-12 6.76e-16 8.20e-04 0s 20 2.31126096e+02 2.25480478e+02 4.20e-12 5.52e-16 3.93e-04 0s 21 2.31214284e+02 2.26080261e+02 3.51e-12 8.88e-16 3.57e-04 0s 22 2.30309752e+02 2.27803531e+02 2.16e-11 6.23e-16 1.74e-04 0s 23 2.29613292e+02 2.28499119e+02 1.58e-11 5.96e-16 7.75e-05 0s 24 2.29313943e+02 2.28958388e+02 1.69e-11 5.48e-16 2.47e-05 0s 25 2.29242346e+02 2.29095188e+02 3.82e-12 5.81e-16 1.02e-05 0s 26 2.29218241e+02 2.29161939e+02 7.71e-12 5.37e-16 3.92e-06 0s 27 2.29207390e+02 2.29194307e+02 6.31e-12 6.06e-16 9.10e-07 0s 28 2.29205030e+02 2.29204806e+02 1.31e-11 6.36e-16 1.56e-08 0s 29 2.29205000e+02 2.29205000e+02 1.10e-11 6.49e-16 1.56e-11 0s Barrier solved model in 29 iterations and 0.33 seconds Optimal objective 2.29205000e+02 Root relaxation: objective 2.292050e+02, 3181 iterations, 0.40 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 229.20500 0 76 2000.00000 229.20500 88.5% - 1s H 0 0 230.0000000 229.20500 0.35% - 1s Explored 0 nodes (9959 simplex iterations) in 1.62 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 2.300000000000e+02, best bound 2.300000000000e+02, gap 0.0% Preprocessing time: 0.35 seconds Gurobi run time: 1.62 seconds Total run time: 1.97 seconds Objective: 230 Solution: 31 x [4, 6, 11, 14, 14, 14, 15, 17, 18] 13 x [1, 2, 4, 6, 7, 12, 15, 16, 18] 5 x [4, 6, 6, 12, 15, 17, 17, 18] 1 x [6, 6, 12, 15, 17, 17, 18] 8 x [4, 6, 11, 15, 15, 18] 1 x [6, 9, 14, 14, 15, 15, 18] 1 x [6, 9, 14, 14, 15, 15, 17, 18] 1 x [1, 5, 8, 12, 15, 15, 16, 18, 19] 5 x [1, 5, 5, 12, 15, 15, 17, 18, 19] 14 x [1, 4, 12, 15, 15, 16, 17, 17, 18] 13 x [1, 9, 11, 13, 16, 16, 18, 18] 5 x [1, 2, 6, 9, 11, 11, 11, 14, 15] 8 x [1, 3, 6, 6, 9, 15, 16, 16] 7 x [3, 5, 5, 12, 15, 17, 19, 19, 19] 3 x [5, 11, 11, 11, 11, 11, 11, 11, 15] 3 x [3, 5, 5, 5, 6, 10, 12, 15, 15] 1 x [1, 8, 15, 15, 16, 19] 1 x [1, 11, 14, 15, 15, 20] 35 x [4, 5, 6, 6, 8, 12, 13, 16, 19] 3 x [3, 5, 5, 5, 5, 6, 6, 6, 13] 6 x [5, 5, 5, 5, 6, 6, 6, 6, 6] 56 x [1, 2, 11, 11, 14, 19, 19, 20, 20] 9 x [1, 4, 4, 4, 4, 4, 12, 16]