Build (method = -2) #dp: 40169 Step-3' Graph: 1020 vertices and 7441 arcs (0.26s) Step-4' Graph: 932 vertices and 7268 arcs (0.27s) #V4/#V3 = 0.91 #A4/#A3 = 0.98 Ready! (0.27s) Optimize a model with 950 rows, 7269 columns and 19951 nonzeros Presolve removed 40 rows and 86 columns Presolve time: 0.06s Presolved: 910 rows, 7183 columns, 19838 nonzeros Variable types: 0 continuous, 7183 integer (0 binary) Found heuristic solution: objective 192.0000000 Optimize a model with 910 rows, 7183 columns and 19838 nonzeros Presolved: 910 rows, 7183 columns, 19838 nonzeros Root barrier log... Ordering time: 0.01s Barrier statistics: AA' NZ : 1.218e+04 Factor NZ : 6.265e+04 (roughly 4 MBytes of memory) Factor Ops : 6.389e+06 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 3.81721337e+03 -2.00963473e+05 2.14e+05 2.22e-16 1.88e+02 0s 1 8.93821679e+02 -1.11029196e+05 3.04e+04 2.33e-15 3.10e+01 0s 2 5.48756664e+02 -4.58569610e+04 1.03e+04 1.55e-15 1.02e+01 0s 3 4.52058754e+02 -2.19691942e+04 2.61e+03 4.44e-15 3.09e+00 0s 4 4.03569179e+02 -8.79226802e+03 7.79e+02 4.00e-15 1.02e+00 0s 5 3.85442719e+02 -3.08611514e+03 1.30e+02 6.22e-15 2.85e-01 0s 6 3.79476499e+02 -1.48613808e+03 6.95e-02 4.00e-15 1.30e-01 0s 7 3.55123272e+02 -8.05196216e+02 1.27e-02 2.00e-15 8.07e-02 0s 8 3.02579323e+02 -7.14537075e+02 8.49e-03 1.78e-15 7.07e-02 0s 9 2.42076160e+02 -3.42279565e+02 6.51e-03 7.10e-16 4.06e-02 0s 10 2.10194694e+02 -1.92739303e+02 5.42e-03 7.09e-16 2.80e-02 0s 11 1.86930614e+02 -1.38179211e+02 4.77e-03 7.33e-16 2.26e-02 0s 12 1.58616394e+02 -1.23683617e+02 3.79e-03 8.90e-16 1.96e-02 0s 13 1.21573793e+02 -5.14453038e+01 2.87e-03 6.46e-16 1.20e-02 0s 14 5.43533880e+01 -1.40279690e+01 1.20e-03 5.25e-16 4.75e-03 0s 15 4.42567093e+01 -7.69073872e+00 9.52e-04 6.35e-16 3.61e-03 0s 16 4.00768745e+01 -5.11893075e+00 8.36e-04 8.43e-16 3.14e-03 0s 17 3.75309169e+01 -4.24670400e+00 7.50e-04 1.25e-15 2.90e-03 0s 18 2.95379952e+01 2.52314476e+00 4.88e-04 7.86e-16 1.88e-03 0s 19 2.60408173e+01 7.35235493e+00 3.48e-04 6.05e-16 1.30e-03 0s 20 2.44635770e+01 1.29737322e+01 2.44e-04 4.18e-16 7.99e-04 0s 21 2.11072251e+01 1.64005288e+01 7.72e-05 3.80e-16 3.27e-04 0s 22 2.06305367e+01 1.91551326e+01 4.39e-05 4.44e-16 1.03e-04 0s 23 2.00309924e+01 1.99021637e+01 2.04e-08 3.33e-16 8.96e-06 0s 24 2.00000291e+01 1.99995451e+01 1.80e-11 3.22e-16 3.37e-08 0s 25 2.00000000e+01 1.99999995e+01 2.15e-12 2.74e-16 3.37e-11 0s 26 2.00000000e+01 2.00000000e+01 9.30e-13 3.33e-16 1.23e-16 0s Barrier solved model in 26 iterations and 0.23 seconds Optimal objective 2.00000000e+01 Root relaxation: objective 2.000000e+01, 4957 iterations, 0.30 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 20.00000 0 75 192.00000 20.00000 89.6% - 1s H 0 0 21.0000000 20.00000 4.76% - 1s H 0 0 20.0000000 20.00000 0.0% - 1s Explored 0 nodes (11340 simplex iterations) in 1.80 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 2.000000000000e+01, best bound 2.000000000000e+01, gap 0.0% Preprocessing time: 0.30 seconds Gurobi run time: 1.80 seconds Total run time: 2.09 seconds Objective: 20 Solution: 1 x [5, 6, 7, 8, 8, 12, 14, 16, 16, 18] 3 x [4, 5, 5, 6, 7, 8, 11, 13, 13, 18] 2 x [6, 7, 8, 9, 10, 10, 12, 16, 16, 18] 1 x [3, 6, 7, 8, 10, 12, 16, 16, 16, 18] 1 x [2, 5, 7, 13, 13, 14, 14, 15, 16, 18] 1 x [2, 3, 5, 7, 9, 15, 16, 16, 16, 18] 1 x [1, 1, 3, 5, 7, 11, 16, 16, 16, 18] 3 x [6, 7, 7, 8, 12, 14, 16, 17, 17, 18] 1 x [1, 2, 2, 2, 6, 9, 14, 16, 16, 18] 1 x [2, 2, 2, 9, 9, 14, 16, 16, 16, 18] 3 x [2, 2, 5, 10, 12, 12, 12, 14, 14, 16] 2 x [5, 9, 9, 9, 11, 15, 16, 16, 16, 18]