Build (method = -2) #dp: 59266 Step-3' Graph: 963 vertices and 5804 arcs (0.41s) Step-4' Graph: 852 vertices and 5587 arcs (0.41s) #V4/#V3 = 0.88 #A4/#A3 = 0.96 Ready! (0.41s) Optimize a model with 872 rows, 5588 columns and 15064 nonzeros Presolve removed 137 rows and 268 columns Presolve time: 0.06s Presolved: 735 rows, 5320 columns, 14804 nonzeros Variable types: 0 continuous, 5320 integer (0 binary) Found heuristic solution: objective 194.0000000 Optimize a model with 735 rows, 5320 columns and 14804 nonzeros Presolved: 735 rows, 5320 columns, 14804 nonzeros Root barrier log... Ordering time: 0.01s Barrier statistics: AA' NZ : 9.150e+03 Factor NZ : 5.256e+04 (roughly 3 MBytes of memory) Factor Ops : 6.136e+06 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 3.97073703e+03 -2.25802708e+05 1.75e+05 2.22e-16 1.84e+02 0s 1 1.02184244e+03 -9.50149905e+04 2.61e+04 8.88e-16 3.14e+01 0s 2 5.73289927e+02 -3.92879122e+04 8.71e+03 2.22e-15 1.06e+01 0s 3 4.39904571e+02 -1.27097559e+04 1.46e+03 5.68e-14 2.22e+00 0s 4 3.98362659e+02 -6.92735114e+03 3.58e+02 1.60e-13 8.99e-01 0s 5 3.84358472e+02 -3.72837029e+03 6.19e+01 7.33e-14 4.13e-01 0s 6 3.44662573e+02 -2.19041264e+03 6.98e-03 4.49e-14 2.38e-01 0s 7 3.04862464e+02 -1.24572038e+03 5.36e-03 2.61e-14 1.45e-01 0s 8 2.32931740e+02 -6.99271904e+02 3.29e-03 1.44e-14 8.75e-02 0s 9 2.00786297e+02 -4.82048819e+02 2.61e-03 9.88e-15 6.41e-02 0s 10 1.73734059e+02 -4.18831150e+02 2.12e-03 8.44e-15 5.56e-02 0s 11 1.18980588e+02 -2.79414980e+02 1.17e-03 5.33e-15 3.74e-02 0s 12 6.88402030e+01 -1.20019372e+02 5.51e-04 1.89e-15 1.77e-02 0s 13 3.89825992e+01 -4.86370148e+01 2.84e-04 8.88e-16 8.22e-03 0s 14 3.24413119e+01 -1.86857275e+01 2.06e-04 3.33e-16 4.80e-03 0s 15 3.02146991e+01 -9.33841987e+00 1.59e-04 4.44e-16 3.71e-03 0s 16 2.72697065e+01 2.04144573e+00 9.95e-05 2.72e-16 2.37e-03 0s 17 2.54904625e+01 1.47482712e+01 5.77e-05 3.33e-16 1.01e-03 0s 18 2.36489168e+01 2.01729683e+01 2.70e-05 2.24e-16 3.26e-04 0s 19 2.28405555e+01 2.17534879e+01 1.13e-05 3.68e-16 1.02e-04 0s 20 2.22291469e+01 2.21979504e+01 1.06e-08 3.64e-16 2.93e-06 0s 21 2.22222292e+01 2.22221980e+01 2.17e-13 3.80e-16 2.93e-09 0s 22 2.22222222e+01 2.22222222e+01 3.02e-13 3.05e-16 4.93e-15 0s Barrier solved model in 22 iterations and 0.18 seconds Optimal objective 2.22222222e+01 Root relaxation: objective 2.222222e+01, 3458 iterations, 0.22 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 22.22222 0 57 194.00000 22.22222 88.5% - 0s H 0 0 24.0000000 22.22222 7.41% - 0s H 0 0 23.0000000 22.22222 3.38% - 0s Explored 0 nodes (7870 simplex iterations) in 0.91 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 2.300000000000e+01, best bound 2.300000000000e+01, gap 0.0% Preprocessing time: 0.44 seconds Gurobi run time: 0.91 seconds Total run time: 1.35 seconds Objective: 23 Solution: 1 x [1, 1, 3, 8, 12, 13, 14, 19, 20] 1 x [1, 1, 3, 8, 12, 13, 19, 20] 2 x [3, 5, 8, 8, 8, 8, 12, 13, 19] 2 x [2, 2, 2, 3, 4, 5, 15, 18, 18] 1 x [2, 2, 2, 2, 3, 5, 6, 8] 1 x [1, 2, 3, 3, 7, 9, 12, 17, 17] 4 x [1, 5, 9, 9, 9, 13, 14, 14, 15] 4 x [1, 4, 5, 9, 14, 14, 16, 16, 16] 1 x [2, 4, 5, 10, 10, 10, 16, 16, 18] 1 x [4, 5, 5, 5, 5, 7, 8, 8, 16] 3 x [1, 9, 11, 11, 11, 11, 11, 11, 11] 1 x [1, 10, 10, 10, 18] 1 x [2, 5, 6, 7, 7, 7, 12, 16]