Build (method = -2) #dp: 86520 Step-3' Graph: 878 vertices and 13479 arcs (0.84s) Step-4' Graph: 693 vertices and 13143 arcs (0.85s) #V4/#V3 = 0.79 #A4/#A3 = 0.98 Ready! (0.85s) Optimize a model with 754 rows, 13144 columns and 38016 nonzeros Presolve removed 22 rows and 35 columns Presolve time: 0.21s Presolved: 732 rows, 13109 columns, 37992 nonzeros Variable types: 0 continuous, 13109 integer (4648 binary) Found heuristic solution: objective 90.0000000 Optimize a model with 732 rows, 13109 columns and 37992 nonzeros Presolved: 732 rows, 13109 columns, 37992 nonzeros Root barrier log... Ordering time: 0.01s Barrier statistics: AA' NZ : 2.409e+04 Factor NZ : 8.131e+04 (roughly 6 MBytes of memory) Factor Ops : 1.292e+07 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 8.90479592e+03 -1.68996114e+05 1.34e+05 8.70e-02 4.41e+01 0s 1 2.48970069e+03 -5.48022245e+04 2.24e+04 4.00e-15 8.24e+00 0s 2 9.21748315e+02 -2.62820803e+04 5.74e+03 3.22e-15 2.54e+00 0s 3 6.90207623e+02 -1.08720224e+04 1.56e+03 5.50e-03 8.17e-01 0s 4 4.90575205e+02 -3.82935370e+03 5.22e+02 1.07e-03 2.74e-01 0s 5 3.59061996e+02 -2.23890402e+03 2.73e+02 5.61e-15 1.52e-01 0s 6 3.06318769e+02 -1.17452857e+03 1.92e+02 4.33e-15 8.90e-02 0s 7 2.76742610e+02 -7.05509544e+02 1.57e+02 3.89e-15 6.11e-02 0s 8 1.98613876e+02 -4.67473060e+02 6.79e+01 4.18e-15 3.42e-02 0s 9 1.84502152e+02 -3.62682103e+02 5.65e+01 4.36e-15 2.75e-02 0s 10 1.72585158e+02 -3.03334807e+02 5.09e+01 4.02e-15 2.39e-02 0s 11 1.44663950e+02 -2.00219682e+02 3.87e+01 4.18e-15 1.70e-02 0s 12 1.33899416e+02 -1.56982426e+02 3.52e+01 5.55e-15 1.44e-02 0s 13 1.13965305e+02 -1.10231346e+02 2.98e+01 4.55e-15 1.12e-02 0s 14 7.91652230e+01 -8.49783987e+01 1.81e+01 3.28e-15 7.81e-03 0s 15 7.16536324e+01 -6.44340511e+01 1.59e+01 3.49e-15 6.47e-03 0s 16 7.04319721e+01 -6.04529720e+01 1.51e+01 4.36e-15 6.18e-03 0s 17 6.02069428e+01 -5.11603326e+01 1.29e+01 5.00e-15 5.23e-03 0s 18 4.28415948e+01 -4.12487833e+01 8.64e+00 4.38e-15 3.84e-03 0s 19 3.08614215e+01 -2.82395551e+01 5.66e+00 4.00e-15 2.63e-03 0s 20 2.52363013e+01 -2.01624481e+01 4.40e+00 4.23e-15 2.00e-03 0s 21 1.90344185e+01 -1.48121324e+01 2.93e+00 3.89e-15 1.46e-03 0s 22 1.57913025e+01 -8.44946388e+00 1.92e+00 3.96e-15 1.02e-03 0s 23 1.52484833e+01 4.65914904e-01 1.52e+00 2.83e-15 6.17e-04 0s 24 1.37294572e+01 6.01919020e+00 7.91e-01 3.28e-15 3.12e-04 0s 25 1.31807803e+01 8.79039046e+00 4.20e-01 3.03e-15 1.75e-04 0s 26 1.25869234e+01 1.20179612e+01 2.07e-02 3.33e-15 2.19e-05 0s 27 1.25008136e+01 1.24758325e+01 1.28e-04 2.65e-15 9.53e-07 0s 28 1.25000008e+01 1.24999758e+01 1.71e-12 6.00e-15 9.53e-10 0s 29 1.25000000e+01 1.25000000e+01 4.20e-13 2.49e-15 9.53e-13 0s Barrier solved model in 29 iterations and 0.49 seconds Optimal objective 1.25000000e+01 Root relaxation: objective 1.250000e+01, 9347 iterations, 0.66 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 12.50000 0 10 90.00000 12.50000 86.1% - 3s H 0 0 14.0000000 12.50000 10.7% - 3s H 0 0 13.0000000 12.50000 3.85% - 3s Explored 0 nodes (17536 simplex iterations) in 3.77 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.300000000000e+01, best bound 1.300000000000e+01, gap 0.0% Preprocessing time: 0.91 seconds Gurobi run time: 3.77 seconds Total run time: 4.68 seconds Objective: 13 Solution: 1 x [2, 4, 13, 20, 30, 43, 50, 61] 1 x [2, 9, 11, 19, 27, 36, 59, 61] 1 x [10, 16, 18, 27, 31, 39, 55, 60] 1 x [18, 28, 28, 33, 36, 48, 52, 59] 1 x [6, 17, 23, 37, 41, 42, 46, 55] 1 x [3, 13, 15, 29, 34, 35, 40, 59] 1 x [12, 14, 25, 26, 38, 44, 57] 1 x [8, 13, 33, 47, 53, 55, 60, 61] 1 x [5, 11, 26, 31, 36, 51] 1 x [1, 1, 7, 21, 48, 52, 53, 59] 1 x [6, 23, 32, 42, 44, 46, 54, 57] 1 x [1, 5, 22, 24, 46, 49, 50, 58] 1 x [28, 30, 36, 43, 45, 56, 58]