Build (method = -2) #dp: 29655 Step-3' Graph: 718 vertices and 4264 arcs (0.18s) Step-4' Graph: 654 vertices and 4136 arcs (0.18s) #V4/#V3 = 0.91 #A4/#A3 = 0.97 Ready! (0.18s) Optimize a model with 673 rows, 4137 columns and 11107 nonzeros Presolve removed 91 rows and 166 columns Presolve time: 0.06s Presolved: 582 rows, 3971 columns, 10969 nonzeros Variable types: 0 continuous, 3971 integer (267 binary) Found heuristic solution: objective 157.0000000 Optimize a model with 582 rows, 3971 columns and 10969 nonzeros Presolve removed 2 rows and 2 columns Presolved: 580 rows, 3969 columns, 10973 nonzeros Root barrier log... Ordering time: 0.01s Barrier statistics: AA' NZ : 6.780e+03 Factor NZ : 3.540e+04 (roughly 2 MBytes of memory) Factor Ops : 3.417e+06 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 4.86490186e+03 -1.61480663e+05 1.69e+05 0.00e+00 2.68e+02 0s 1 1.30420776e+03 -8.72831965e+04 2.55e+04 1.55e-15 4.58e+01 0s 2 4.98822831e+02 -3.54390899e+04 5.39e+03 4.88e-15 1.09e+01 0s 3 3.33432918e+02 -1.12293892e+04 1.50e+03 1.95e-14 2.90e+00 0s 4 2.77021919e+02 -4.56099061e+03 4.16e+02 1.51e-14 9.60e-01 0s 5 2.50358380e+02 -3.40749571e+03 2.27e+02 1.13e-14 6.42e-01 0s 6 2.08273528e+02 -1.85707635e+03 6.99e+01 7.55e-15 3.05e-01 0s 7 1.99341766e+02 -9.42113326e+02 3.79e+01 3.77e-15 1.60e-01 0s 8 1.96261954e+02 -4.24141114e+02 1.11e+01 3.11e-15 8.13e-02 0s 9 1.66583812e+02 -4.15080949e+02 7.33e+00 3.45e-15 7.55e-02 0s 10 1.28925241e+02 -2.65681111e+02 4.05e+00 3.44e-15 5.07e-02 0s 11 9.42297742e+01 -1.70497224e+02 2.56e+00 2.92e-15 3.39e-02 0s 12 6.36406347e+01 -1.22248277e+02 1.54e+00 3.14e-15 2.37e-02 0s 13 4.97919201e+01 -5.33573632e+01 1.14e+00 2.61e-15 1.32e-02 0s 14 3.61079206e+01 -1.80421517e+01 5.77e-01 2.35e-15 6.91e-03 0s 15 3.03967810e+01 2.62799819e+00 3.49e-01 2.64e-15 3.54e-03 0s 16 2.94740045e+01 1.17407466e+01 3.05e-01 2.50e-15 2.26e-03 0s 17 2.80256000e+01 1.68837278e+01 2.17e-01 2.60e-15 1.42e-03 0s 18 2.58576777e+01 2.21586913e+01 4.81e-02 2.31e-15 4.68e-04 0s 19 2.53711048e+01 2.40270452e+01 2.02e-02 2.20e-15 1.70e-04 0s 20 2.50077309e+01 2.48494515e+01 3.51e-04 1.67e-15 1.99e-05 0s 21 2.50000473e+01 2.49998387e+01 1.28e-11 2.38e-15 2.62e-08 0s 22 2.50000000e+01 2.49999998e+01 4.38e-12 2.41e-15 2.62e-11 0s Barrier solved model in 22 iterations and 0.12 seconds Optimal objective 2.50000000e+01 Root relaxation: objective 2.500000e+01, 2448 iterations, 0.17 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 25.00000 0 72 157.00000 25.00000 84.1% - 0s H 0 0 26.0000000 25.00000 3.85% - 0s H 0 0 25.0000000 25.00000 0.0% - 0s Explored 0 nodes (5641 simplex iterations) in 0.77 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 2.500000000000e+01, best bound 2.500000000000e+01, gap 0.0% Preprocessing time: 0.20 seconds Gurobi run time: 0.77 seconds Total run time: 0.97 seconds Objective: 25 Solution: 1 x [4, 5, 5, 6, 8, 16, 18, 19] 5 x [3, 7, 15, 15, 16, 17, 18, 18] 1 x [3, 4, 6, 11, 12, 15, 15, 17] 1 x [2, 3, 5, 5, 5, 6, 11, 12] 1 x [1, 1, 3, 4, 11, 11, 11, 13] 1 x [2, 2, 3, 11, 11, 11, 17, 17] 2 x [3, 3, 7, 10, 10, 10, 11, 16] 2 x [2, 4, 5, 5, 7, 11, 12, 16] 1 x [1, 2, 2, 7, 7, 9, 11, 12] 2 x [4, 5, 6, 8, 8, 10, 12, 14] 4 x [4, 5, 6, 8, 9, 9, 12, 12] 1 x [4, 6, 6, 7, 7, 10, 14, 17] 1 x [1, 4, 4, 6, 7, 7, 10, 14] 1 x [1, 7, 7, 7, 10, 10, 14, 14] 1 x [1, 2, 7, 9, 9, 14, 14, 14]