Build (method = -2) #dp: 54849 Step-3' Graph: 1357 vertices and 8428 arcs (0.37s) Step-4' Graph: 1284 vertices and 8286 arcs (0.38s) #V4/#V3 = 0.95 #A4/#A3 = 0.98 Ready! (0.38s) Optimize a model with 1303 rows, 8287 columns and 22302 nonzeros Presolve removed 258 rows and 485 columns Presolve time: 0.13s Presolved: 1045 rows, 7802 columns, 21830 nonzeros Variable types: 0 continuous, 7802 integer (1048 binary) Found heuristic solution: objective 200.0000000 Optimize a model with 1045 rows, 7802 columns and 21830 nonzeros Presolve removed 1 rows and 1 columns Presolved: 1044 rows, 7801 columns, 21839 nonzeros Root barrier log... Ordering time: 0.05s Barrier statistics: AA' NZ : 1.346e+04 Factor NZ : 1.061e+05 (roughly 4 MBytes of memory) Factor Ops : 1.865e+07 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 3.56296840e+03 -1.89087049e+05 2.19e+05 2.79e-02 1.55e+02 0s 1 9.37297821e+02 -1.19447488e+05 3.55e+04 7.77e-16 2.94e+01 0s 2 5.29370698e+02 -4.87323233e+04 1.02e+04 1.78e-15 8.67e+00 0s 3 4.18075409e+02 -2.13151158e+04 2.82e+03 2.32e-04 2.70e+00 0s 4 3.28986988e+02 -6.23901695e+03 5.79e+02 5.33e-15 6.59e-01 0s 5 2.79506827e+02 -2.26431460e+03 2.12e+02 4.44e-15 2.39e-01 0s 6 2.16633970e+02 -1.05471908e+03 6.80e+01 2.22e-15 1.00e-01 0s 7 1.99872823e+02 -6.96233220e+02 4.09e+01 1.78e-15 6.63e-02 0s 8 2.05603436e+02 -6.48991804e+02 3.90e+01 1.67e-15 6.29e-02 0s 9 1.98971199e+02 -3.77224198e+02 3.13e+01 1.11e-15 4.18e-02 0s 10 1.95158379e+02 -3.42302772e+02 2.70e+01 9.99e-16 3.86e-02 0s 11 1.45177222e+02 -2.63075290e+02 1.71e+01 8.88e-16 2.86e-02 0s 12 9.72541205e+01 -1.38814936e+02 9.61e+00 3.89e-16 1.64e-02 0s 13 7.34130916e+01 -8.04627003e+01 6.79e+00 3.76e-16 1.07e-02 0s 14 5.59083701e+01 -4.84339755e+01 4.85e+00 3.96e-16 7.27e-03 0s 15 4.10801520e+01 -3.88260705e+01 3.34e+00 4.54e-16 5.52e-03 0s 16 3.36491776e+01 -2.50048067e+01 2.50e+00 3.37e-16 4.04e-03 0s 17 2.76210476e+01 -1.32292050e+01 1.81e+00 3.66e-16 2.80e-03 0s 18 2.38085090e+01 -6.36999552e-02 1.05e+00 3.48e-16 1.62e-03 0s 19 2.25662724e+01 6.72301854e+00 7.58e-01 3.07e-16 1.07e-03 0s 20 2.20485094e+01 1.36651345e+01 6.01e-01 2.82e-16 5.68e-04 0s 21 2.05744836e+01 1.73476393e+01 1.19e-01 3.19e-16 2.11e-04 0s 22 2.00220344e+01 1.95793831e+01 2.14e-03 3.37e-16 2.84e-05 0s 23 2.00001378e+01 1.99979357e+01 5.88e-12 2.58e-16 1.41e-07 0s 24 2.00000000e+01 2.00000000e+01 3.89e-12 2.93e-16 1.57e-13 0s Barrier solved model in 24 iterations and 0.44 seconds Optimal objective 2.00000000e+01 Root relaxation: objective 2.000000e+01, 5105 iterations, 0.53 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 20.00000 0 70 200.00000 20.00000 90.0% - 1s H 0 0 28.0000000 20.00000 28.6% - 1s H 0 0 22.0000000 20.00000 9.09% - 1s H 0 0 20.0000000 20.00000 0.0% - 1s Explored 0 nodes (9735 simplex iterations) in 1.76 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 2.000000000000e+01, best bound 2.000000000000e+01, gap 0.0% Preprocessing time: 0.41 seconds Gurobi run time: 1.76 seconds Total run time: 2.17 seconds Objective: 20 Solution: 2 x [1, 1, 5, 6, 6, 6, 6, 12, 13, 18] 2 x [1, 1, 5, 9, 10, 16, 16, 16, 16, 19] 2 x [1, 1, 2, 5, 7, 12, 12, 18, 19, 19] 1 x [2, 5, 9, 11, 11, 12, 16, 16, 16, 16] 1 x [1, 1, 4, 5, 9, 10, 12, 12, 12, 14] 3 x [1, 5, 5, 5, 11, 11, 11, 11, 11, 18] 1 x [8, 9, 9, 9, 9, 12, 17, 17, 17, 19] 1 x [4, 4, 9, 9, 9, 12, 12, 13, 16, 16] 1 x [2, 4, 9, 11, 11, 11, 12, 13, 13, 17] 2 x [7, 9, 11, 11, 11, 11, 12, 13, 13, 17] 1 x [2, 2, 7, 7, 9, 15, 15, 15, 16, 16] 2 x [3, 4, 4, 4, 4, 12, 16, 17, 17, 18] 1 x [4, 4, 4, 4, 9, 11, 12, 17, 17, 17]