Build (method = -2) #dp: 21279 Step-3' Graph: 549 vertices and 3076 arcs (0.12s) Step-4' Graph: 473 vertices and 2923 arcs (0.12s) #V4/#V3 = 0.86 #A4/#A3 = 0.95 Ready! (0.12s) Optimize a model with 489 rows, 2924 columns and 7837 nonzeros Presolve removed 63 rows and 121 columns Presolve time: 0.03s Presolved: 426 rows, 2803 columns, 7751 nonzeros Variable types: 0 continuous, 2803 integer (0 binary) Found heuristic solution: objective 114.0000000 Optimize a model with 426 rows, 2803 columns and 7751 nonzeros Presolved: 426 rows, 2803 columns, 7751 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 4.720e+03 Factor NZ : 2.034e+04 (roughly 1 MByte of memory) Factor Ops : 1.398e+06 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.92395512e+03 -5.82494646e+04 5.62e+04 2.22e-16 8.80e+01 0s 1 5.27108809e+02 -3.01686888e+04 8.73e+03 1.11e-15 1.64e+01 0s 2 3.20383040e+02 -1.23419045e+04 2.83e+03 3.55e-15 5.32e+00 0s 3 2.28046109e+02 -4.28055445e+03 5.77e+02 5.77e-15 1.34e+00 0s 4 2.02814494e+02 -1.22868334e+03 1.00e+02 1.55e-15 3.25e-01 0s 5 1.94258415e+02 -4.95534226e+02 1.21e+01 9.99e-16 1.28e-01 0s 6 1.62611401e+02 -4.37901384e+02 8.36e+00 1.01e-15 1.11e-01 0s 7 1.39781457e+02 -2.92128914e+02 6.14e+00 1.01e-15 7.91e-02 0s 8 1.12517315e+02 -1.94083230e+02 4.72e+00 8.91e-16 5.61e-02 0s 9 7.29669929e+01 -9.21611738e+01 2.79e+00 7.82e-16 3.02e-02 0s 10 4.51053593e+01 -5.63147817e+01 1.36e+00 7.79e-16 1.84e-02 0s 11 3.46737542e+01 -2.60860329e+01 6.70e-01 7.64e-16 1.10e-02 0s 12 3.28636026e+01 -1.20376877e+01 5.32e-01 8.27e-16 8.10e-03 0s 13 3.04141565e+01 2.71312834e+00 3.72e-01 6.11e-16 4.99e-03 0s 14 2.79548696e+01 1.55962821e+01 2.12e-01 5.35e-16 2.23e-03 0s 15 2.57790359e+01 2.05899511e+01 6.75e-02 5.49e-16 9.30e-04 0s 16 2.58860890e+01 2.23762890e+01 6.32e-02 7.39e-16 6.30e-04 0s 17 2.50156430e+01 2.46360259e+01 4.10e-05 6.12e-16 6.75e-05 0s 18 2.50009790e+01 2.49977912e+01 2.42e-08 5.55e-16 5.67e-07 0s 19 2.50000000e+01 2.50000000e+01 4.65e-12 5.55e-16 2.00e-12 0s Barrier solved model in 19 iterations and 0.06 seconds Optimal objective 2.50000000e+01 Root relaxation: objective 2.500000e+01, 1812 iterations, 0.08 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 25.00000 0 60 114.00000 25.00000 78.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 (2764 simplex iterations) in 0.26 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.14 seconds Gurobi run time: 0.26 seconds Total run time: 0.40 seconds Objective: 25 Solution: 1 x [1, 4, 6, 8, 11, 11, 11, 14] 7 x [1, 2, 3, 4, 7, 9, 10, 14] 1 x [1, 2, 4, 6, 6, 9, 11, 15] 1 x [1, 1, 1, 3, 4, 14, 14, 15] 4 x [4, 4, 4, 5, 6, 10, 11, 11] 1 x [3, 4, 4, 4, 6, 6, 10, 14] 3 x [4, 4, 4, 6, 6, 6, 6, 15] 1 x [1, 2, 8, 9, 11, 13, 14, 14] 1 x [2, 9, 13, 13, 13, 13, 14, 14] 4 x [5, 6, 9, 12, 12, 13, 13, 13] 1 x [6, 7, 9, 12, 12, 14, 16, 16]