Build (method = -2) #dp: 45970 Step-3' Graph: 1195 vertices and 7898 arcs (0.28s) Step-4' Graph: 1115 vertices and 7744 arcs (0.29s) #V4/#V3 = 0.93 #A4/#A3 = 0.98 Ready! (0.29s) Optimize a model with 1135 rows, 7745 columns and 21007 nonzeros Presolve removed 105 rows and 201 columns Presolve time: 0.08s Presolved: 1030 rows, 7544 columns, 20824 nonzeros Variable types: 0 continuous, 7544 integer (0 binary) Found heuristic solution: objective 178.0000000 Optimize a model with 1030 rows, 7544 columns and 20824 nonzeros Presolved: 1030 rows, 7544 columns, 20824 nonzeros Root barrier log... Ordering time: 0.01s Barrier statistics: AA' NZ : 1.345e+04 Factor NZ : 9.016e+04 (roughly 4 MBytes of memory) Factor Ops : 1.326e+07 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 3.68027682e+03 -2.65488473e+05 2.02e+05 2.22e-16 1.84e+02 0s 1 9.15872281e+02 -1.34907682e+05 2.97e+04 1.07e-14 3.16e+01 0s 2 4.93239457e+02 -6.41771509e+04 9.55e+03 5.77e-15 1.07e+01 0s 3 3.24488613e+02 -2.64473012e+04 2.78e+03 9.77e-15 3.36e+00 0s 4 2.82739188e+02 -1.08723302e+04 7.75e+02 2.71e-14 1.13e+00 0s 5 2.52187459e+02 -4.74611867e+03 2.17e+02 2.04e-14 4.24e-01 0s 6 1.98902105e+02 -1.53997514e+03 2.87e+01 9.33e-15 1.24e-01 0s 7 1.94809157e+02 -4.68255451e+02 4.18e-12 4.20e-15 4.39e-02 0s 8 1.74082830e+02 -3.34248714e+02 8.00e-12 5.97e-15 3.36e-02 0s 9 1.20956331e+02 -2.74078772e+02 5.26e-12 6.47e-15 2.61e-02 0s 10 8.67541059e+01 -1.69752471e+02 3.51e-12 6.94e-15 1.70e-02 0s 11 5.06190227e+01 -8.64976083e+01 1.92e-12 6.00e-15 9.08e-03 0s 12 3.98045840e+01 -4.62163780e+01 1.39e-12 5.56e-15 5.69e-03 0s 13 3.71542183e+01 -3.12718789e+01 1.16e-12 6.83e-15 4.53e-03 0s 14 3.30034744e+01 -1.48617579e+01 9.26e-13 6.92e-15 3.17e-03 0s 15 2.96394308e+01 -3.87864522e+00 6.90e-13 7.11e-15 2.22e-03 0s 16 2.75575438e+01 7.54362011e+00 4.57e-13 5.37e-15 1.32e-03 0s 17 2.52003919e+01 1.70260640e+01 7.64e-13 4.36e-15 5.41e-04 0s 18 2.51048972e+01 2.03175098e+01 4.26e-13 5.47e-15 3.17e-04 0s 19 2.42233808e+01 2.18981759e+01 2.47e-13 5.13e-15 1.54e-04 0s 20 2.39647989e+01 2.29502001e+01 5.59e-13 4.84e-15 6.72e-05 0s 21 2.37553820e+01 2.34005122e+01 6.99e-13 4.25e-15 2.35e-05 0s 22 2.37118718e+01 2.36048202e+01 6.76e-13 4.06e-15 7.09e-06 0s 23 2.36947743e+01 2.36381856e+01 1.03e-12 5.45e-15 3.75e-06 0s 24 2.36903607e+01 2.36571028e+01 3.97e-13 5.58e-15 2.20e-06 0s 25 2.36856145e+01 2.36779238e+01 4.05e-13 4.06e-15 5.09e-07 0s 26 2.36840345e+01 2.36838602e+01 2.59e-13 3.72e-15 1.15e-08 0s 27 2.36840000e+01 2.36839999e+01 2.90e-13 3.52e-15 1.15e-11 0s Barrier solved model in 27 iterations and 0.40 seconds Optimal objective 2.36840000e+01 Root relaxation: objective 2.368400e+01, 3438 iterations, 0.48 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 23.68400 0 91 178.00000 23.68400 86.7% - 1s H 0 0 25.0000000 23.68400 5.26% - 1s H 0 0 24.0000000 23.68400 1.32% - 1s Explored 0 nodes (7653 simplex iterations) in 1.72 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 2.400000000000e+01, best bound 2.400000000000e+01, gap 0.0% Preprocessing time: 0.32 seconds Gurobi run time: 1.72 seconds Total run time: 2.05 seconds Objective: 24 Solution: 1 x [4, 5, 6, 9, 11, 15, 20] 1 x [3, 6, 10, 12, 13, 13, 15, 15, 18] 1 x [2, 2, 3, 6, 6, 13, 14, 17] 2 x [2, 6, 6, 6, 12, 13, 13, 20] 1 x [4, 4, 6, 6, 6, 11, 12, 12] 1 x [2, 2, 8, 13, 15, 16, 17, 17] 1 x [2, 4, 5, 11, 15, 17, 17, 17] 2 x [4, 8, 8, 9, 9, 15, 16, 16, 19] 1 x [4, 8, 8, 8, 9, 9, 11, 12, 15] 1 x [2, 4, 5, 7, 8, 8, 8, 15, 16] 1 x [1, 12, 13, 15, 15, 17, 20] 1 x [2, 4, 7, 9, 9, 12, 13, 15, 15] 1 x [4, 5, 9, 9, 11, 12, 12, 15, 15] 1 x [1, 3, 8, 14, 17, 17, 20] 1 x [1, 2, 3, 4, 7, 13, 16, 20, 20] 2 x [1, 2, 2, 3, 9, 9, 12, 12] 1 x [1, 2, 2, 9, 9, 10, 10, 18] 3 x [1, 1, 2, 10, 13, 13, 14, 17, 20] 1 x [1, 1, 4, 4, 8, 14, 20, 20]