Build (method = -2) #dp: 37275 Step-3' Graph: 828 vertices and 4941 arcs (0.23s) Step-4' Graph: 735 vertices and 4759 arcs (0.23s) #V4/#V3 = 0.89 #A4/#A3 = 0.96 Ready! (0.23s) Optimize a model with 755 rows, 4760 columns and 12814 nonzeros Presolve removed 73 rows and 139 columns Presolve time: 0.06s Presolved: 682 rows, 4621 columns, 12721 nonzeros Variable types: 0 continuous, 4621 integer (0 binary) Found heuristic solution: objective 195.0000000 Optimize a model with 682 rows, 4621 columns and 12721 nonzeros Presolved: 682 rows, 4621 columns, 12721 nonzeros Root barrier log... Ordering time: 0.01s Barrier statistics: AA' NZ : 8.071e+03 Factor NZ : 3.791e+04 (roughly 2 MBytes of memory) Factor Ops : 3.239e+06 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 3.97522488e+03 -1.79191468e+05 1.46e+05 2.22e-16 1.93e+02 0s 1 1.05024108e+03 -8.81022962e+04 2.26e+04 2.89e-15 3.43e+01 0s 2 5.18344981e+02 -3.73155415e+04 6.28e+03 1.78e-15 1.01e+01 0s 3 4.23809976e+02 -1.09354667e+04 1.46e+03 9.33e-15 2.37e+00 0s 4 3.72927548e+02 -4.57563873e+03 3.17e+02 5.77e-15 7.44e-01 0s 5 3.47368626e+02 -2.72759477e+03 1.35e+02 6.22e-15 4.06e-01 0s 6 3.15786147e+02 -1.54092296e+03 9.10e+01 3.11e-15 2.37e-01 0s 7 2.56403009e+02 -8.93277433e+02 5.60e+01 1.67e-15 1.42e-01 0s 8 1.99348619e+02 -7.07117662e+02 1.92e+01 1.58e-15 1.03e-01 0s 9 2.04052421e+02 -5.95606851e+02 1.77e+01 1.79e-15 9.06e-02 0s 10 1.82154781e+02 -4.94705917e+02 1.18e+01 1.86e-15 7.57e-02 0s 11 1.40782419e+02 -4.25448102e+02 7.22e+00 2.09e-15 6.27e-02 0s 12 1.05278076e+02 -2.55114115e+02 4.37e+00 1.74e-15 3.98e-02 0s 13 6.59703326e+01 -1.13859369e+02 2.26e+00 1.28e-15 1.98e-02 0s 14 4.28123259e+01 -7.42838002e+01 1.21e+00 1.32e-15 1.29e-02 0s 15 3.45592138e+01 -2.64395962e+01 8.57e-01 1.22e-15 6.72e-03 0s 16 3.23406149e+01 -1.25617120e+01 6.89e-01 1.35e-15 4.94e-03 0s 17 3.20159401e+01 -1.02342962e+01 6.48e-01 1.77e-15 4.65e-03 0s 18 3.00599612e+01 -2.64597909e+00 5.47e-01 1.93e-15 3.60e-03 0s 19 2.90462651e+01 2.12138532e+00 4.74e-01 2.21e-15 2.96e-03 0s 20 2.69236860e+01 1.58199181e+01 2.23e-01 1.23e-15 1.21e-03 0s 21 2.65854501e+01 2.27565139e+01 1.34e-01 1.18e-15 4.20e-04 0s 22 2.51109636e+01 2.43557839e+01 1.20e-02 1.03e-15 8.21e-05 0s 23 2.50003591e+01 2.49970349e+01 1.36e-06 1.08e-15 3.59e-07 0s 24 2.50000000e+01 2.50000000e+01 9.67e-13 8.56e-16 3.74e-13 0s Barrier solved model in 24 iterations and 0.14 seconds Optimal objective 2.50000000e+01 Root relaxation: objective 2.500000e+01, 3121 iterations, 0.19 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 25.00000 0 76 195.00000 25.00000 87.2% - 0s H 0 0 26.0000000 25.00000 3.85% - 0s H 0 0 25.0000000 25.00000 0.0% - 0s Explored 0 nodes (6526 simplex iterations) in 0.88 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.25 seconds Gurobi run time: 0.88 seconds Total run time: 1.13 seconds Objective: 25 Solution: 3 x [2, 4, 6, 7, 10, 12, 15, 17] 1 x [1, 5, 6, 12, 12, 13, 17, 20] 1 x [1, 4, 4, 6, 12, 12, 17, 20] 3 x [2, 3, 6, 8, 11, 12, 17, 20] 1 x [2, 3, 5, 6, 8, 12, 13, 17] 2 x [2, 5, 6, 6, 9, 10, 13, 18] 1 x [1, 2, 10, 13, 14, 15, 17, 17] 1 x [1, 1, 11, 13, 14, 15, 15, 20] 1 x [1, 3, 13, 14, 14, 15, 15, 15] 2 x [1, 4, 12, 13, 15, 15, 15, 19] 1 x [1, 2, 2, 2, 4, 8, 13, 16] 1 x [1, 2, 2, 2, 2, 8, 11, 16] 1 x [1, 1, 1, 1, 13, 14, 14, 20] 5 x [4, 8, 9, 9, 9, 13, 16, 20] 1 x [2, 2, 3, 8, 8, 12, 13, 17]