Build (method = -2) #dp: 30946 Step-3' Graph: 742 vertices and 4165 arcs (0.18s) Step-4' Graph: 627 vertices and 3936 arcs (0.18s) #V4/#V3 = 0.85 #A4/#A3 = 0.95 Ready! (0.19s) Optimize a model with 646 rows, 3937 columns and 10567 nonzeros Presolve removed 66 rows and 123 columns Presolve time: 0.08s Presolved: 580 rows, 3814 columns, 10482 nonzeros Variable types: 0 continuous, 3814 integer (248 binary) Found heuristic solution: objective 169.0000000 Optimize a model with 580 rows, 3814 columns and 10482 nonzeros Presolved: 580 rows, 3814 columns, 10482 nonzeros Root barrier log... Ordering time: 0.01s Barrier statistics: AA' NZ : 6.356e+03 Factor NZ : 2.510e+04 (roughly 2 MBytes of memory) Factor Ops : 1.546e+06 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 3.81664189e+03 -8.90652432e+04 1.23e+05 1.52e-01 1.61e+02 0s 1 8.03773601e+02 -4.78186683e+04 1.67e+04 6.66e-16 2.54e+01 0s 2 4.27826225e+02 -2.01483089e+04 4.60e+03 7.77e-16 7.30e+00 0s 3 2.77951724e+02 -5.96564124e+03 8.55e+02 9.71e-16 1.54e+00 0s 4 2.08546585e+02 -3.19477300e+03 1.25e+02 2.89e-15 5.38e-01 0s 5 2.00460855e+02 -1.25447609e+03 4.85e+01 2.66e-15 2.15e-01 0s 6 1.95662624e+02 -7.33632462e+02 1.47e+01 1.33e-15 1.27e-01 0s 7 1.76235256e+02 -6.38701244e+02 8.82e+00 1.33e-15 1.10e-01 0s 8 1.17850069e+02 -3.52485703e+02 4.42e+00 4.58e-16 6.29e-02 0s 9 7.62352044e+01 -1.71112930e+02 2.25e+00 5.55e-16 3.29e-02 0s 10 5.34125156e+01 -7.60864188e+01 1.32e+00 3.30e-16 1.72e-02 0s 11 3.77301190e+01 -4.60799595e+01 7.21e-01 3.80e-16 1.11e-02 0s 12 3.56576385e+01 -2.44343874e+01 5.81e-01 2.67e-16 7.97e-03 0s 13 3.21425036e+01 -1.60277494e+01 3.84e-01 2.47e-16 6.37e-03 0s 14 3.11145970e+01 -2.65715416e+00 3.49e-01 2.22e-16 4.47e-03 0s 15 2.73237401e+01 6.05201111e+00 1.66e-01 2.17e-16 2.81e-03 0s 16 2.60505972e+01 1.58262112e+01 8.21e-02 2.32e-16 1.35e-03 0s 17 2.60139642e+01 1.71560653e+01 7.65e-02 2.22e-16 1.17e-03 0s 18 2.52845976e+01 2.32225419e+01 1.24e-02 2.55e-16 2.71e-04 0s 19 2.50150095e+01 2.49227965e+01 2.14e-13 2.93e-16 1.21e-05 0s 20 2.50000153e+01 2.49999221e+01 3.71e-13 3.33e-16 1.22e-08 0s 21 2.50000000e+01 2.50000000e+01 3.69e-13 3.33e-16 1.22e-14 0s Barrier solved model in 21 iterations and 0.08 seconds Optimal objective 2.50000000e+01 Root relaxation: objective 2.500000e+01, 2737 iterations, 0.12 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 25.00000 0 30 169.00000 25.00000 85.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 (4189 simplex iterations) in 0.46 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.21 seconds Gurobi run time: 0.46 seconds Total run time: 0.66 seconds Objective: 25 Solution: 1 x [2, 4, 6, 6, 8, 14, 16, 17] 1 x [2, 4, 6, 7, 7, 8, 10, 13] 1 x [2, 4, 9, 11, 11, 13, 13, 19] 1 x [2, 2, 3, 3, 4, 6, 14, 19] 2 x [1, 2, 2, 8, 12, 12, 17, 19] 3 x [2, 2, 14, 14, 14, 17, 17, 19] 2 x [2, 2, 2, 4, 8, 8, 14, 19] 2 x [1, 7, 11, 16, 16, 18, 19, 19] 1 x [1, 6, 8, 14, 16, 16, 16, 18] 4 x [3, 6, 8, 14, 16, 16, 16, 17] 1 x [1, 4, 11, 13, 13, 14, 17, 17] 1 x [1, 1, 3, 4, 4, 11, 13, 18] 1 x [3, 4, 4, 11, 13, 18, 19, 19] 1 x [4, 4, 4, 7, 7, 8, 11, 19] 1 x [4, 4, 4, 5, 7, 7, 8, 11] 2 x [3, 3, 13, 13, 13, 13, 13, 15]